Isodual and self-dual codes from graphs
Binary linear codes are constructed from graphs, in particular, by the generator matrix [In|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...
Збережено в:
| Дата: | 2021 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2021
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/188717 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Isodual and self-dual codes from graphs / S. Mallik, B. Yildiz // Algebra and Discrete Mathematics. — 2021. — Vol. 32, № 1. — С. 49–64. — Бібліогр.: 15 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| id |
irk-123456789-188717 |
|---|---|
| record_format |
dspace |
| spelling |
irk-123456789-1887172023-03-13T19:11:46Z Isodual and self-dual codes from graphs Mallik, S. Yildiz, B. Binary linear codes are constructed from graphs, in particular, by the generator matrix [In|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. 2021 Article Isodual and self-dual codes from graphs / S. Mallik, B. Yildiz // Algebra and Discrete Mathematics. — 2021. — Vol. 32, № 1. — С. 49–64. — Бібліогр.: 15 назв. — англ. 1726-3255 DOI:10.12958/adm1645 2020 MSC: 94B05, 94B25. http://dspace.nbuv.gov.ua/handle/123456789/188717 en Algebra and Discrete Mathematics Інститут прикладної математики і механіки НАН України |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| language |
English |
| description |
Binary linear codes are constructed from graphs, in particular, by the generator matrix [In|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. |
| format |
Article |
| author |
Mallik, S. Yildiz, B. |
| spellingShingle |
Mallik, S. Yildiz, B. Isodual and self-dual codes from graphs Algebra and Discrete Mathematics |
| author_facet |
Mallik, S. Yildiz, B. |
| author_sort |
Mallik, S. |
| title |
Isodual and self-dual codes from graphs |
| title_short |
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_sort |
isodual and self-dual codes from graphs |
| publisher |
Інститут прикладної математики і механіки НАН України |
| publishDate |
2021 |
| url |
http://dspace.nbuv.gov.ua/handle/123456789/188717 |
| citation_txt |
Isodual and self-dual codes from graphs / S. Mallik, B. Yildiz // Algebra and Discrete Mathematics. — 2021. — Vol. 32, № 1. — С. 49–64. — Бібліогр.: 15 назв. — англ. |
| series |
Algebra and Discrete Mathematics |
| work_keys_str_mv |
AT malliks isodualandselfdualcodesfromgraphs AT yildizb isodualandselfdualcodesfromgraphs |
| first_indexed |
2023-10-18T23:09:00Z |
| last_indexed |
2023-10-18T23:09:00Z |
| _version_ |
1796157376077758464 |