Isodual and self-dual codes from graphs
Binary linear codes are constructed from graphs, in particular, by the generator matrix \([I_n | A]\) where \(A\) is the adjacency matrix of a graph on \(n\) vertices. A combinatorial interpretation of the minimum distance of such codes is given. We also present graph theoretic conditions for such l...
Saved in:
| Date: | 2021 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2021
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1645 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete Mathematics| _version_ | 1856543242977280000 |
|---|---|
| author | Mallik, S. Yildiz, B. |
| author_facet | Mallik, S. Yildiz, B. |
| author_sort | Mallik, S. |
| baseUrl_str | |
| collection | OJS |
| datestamp_date | 2021-11-09T03:53:16Z |
| description | Binary linear codes are constructed from graphs, in particular, by the generator matrix \([I_n | A]\) where \(A\) is the adjacency matrix of a graph on \(n\) vertices. A combinatorial interpretation of the minimum distance of such codes is given. We also present graph theoretic conditions for such linear codes to be Type I and Type II self-dual. Several examples of binary linear codes produced by well-known graph classes are given. |
| first_indexed | 2026-02-08T08:00:07Z |
| format | Article |
| id | admjournalluguniveduua-article-1645 |
| institution | Algebra and Discrete Mathematics |
| language | English |
| last_indexed | 2026-02-08T08:00:07Z |
| publishDate | 2021 |
| publisher | Lugansk National Taras Shevchenko University |
| record_format | ojs |
| spelling | admjournalluguniveduua-article-16452021-11-09T03:53:16Z Isodual and self-dual codes from graphs Mallik, S. Yildiz, B. self-dual codes, isodual codes, graphs, adjacency matrix, strongly regular graphs 94B05, 94B25 Binary linear codes are constructed from graphs, in particular, by the generator matrix \([I_n | A]\) where \(A\) is the adjacency matrix of a graph on \(n\) vertices. A combinatorial interpretation of the minimum distance of such codes is given. We also present graph theoretic conditions for such linear codes to be Type I and Type II self-dual. Several examples of binary linear codes produced by well-known graph classes are given. Lugansk National Taras Shevchenko University 2021-11-09 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1645 10.12958/adm1645 Algebra and Discrete Mathematics; Vol 32, No 1 (2021) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1645/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/1645/733 https://admjournal.luguniv.edu.ua/index.php/adm/article/downloadSuppFile/1645/926 Copyright (c) 2021 Algebra and Discrete Mathematics |
| spellingShingle | self-dual codes isodual codes graphs adjacency matrix strongly regular graphs 94B05 94B25 Mallik, S. Yildiz, B. Isodual and self-dual codes from graphs |
| title | Isodual and self-dual codes from graphs |
| title_full | Isodual and self-dual codes from graphs |
| title_fullStr | Isodual and self-dual codes from graphs |
| title_full_unstemmed | Isodual and self-dual codes from graphs |
| title_short | Isodual and self-dual codes from graphs |
| title_sort | isodual and self-dual codes from graphs |
| topic | self-dual codes isodual codes graphs adjacency matrix strongly regular graphs 94B05 94B25 |
| topic_facet | self-dual codes isodual codes graphs adjacency matrix strongly regular graphs 94B05 94B25 |
| url | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1645 |
| work_keys_str_mv | AT malliks isodualandselfdualcodesfromgraphs AT yildizb isodualandselfdualcodesfromgraphs |