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...
Збережено в:
| Опубліковано в: : | Algebra and Discrete Mathematics |
|---|---|
| Дата: | 2021 |
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2021
|
| Онлайн доступ: | https://nasplib.isofts.kiev.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 |
nasplib_isofts_kiev_ua-123456789-188717 |
|---|---|
| record_format |
dspace |
| spelling |
Mallik, S. Yildiz, B. 2023-03-12T18:11:20Z 2023-03-12T18:11:20Z 2021 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. https://nasplib.isofts.kiev.ua/handle/123456789/188717 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. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics Isodual and self-dual codes from graphs Article published earlier |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| title |
Isodual and self-dual codes from graphs |
| spellingShingle |
Isodual and self-dual codes from graphs Mallik, S. Yildiz, B. |
| 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 |
| author |
Mallik, S. Yildiz, B. |
| author_facet |
Mallik, S. Yildiz, B. |
| publishDate |
2021 |
| language |
English |
| container_title |
Algebra and Discrete Mathematics |
| publisher |
Інститут прикладної математики і механіки НАН України |
| format |
Article |
| 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.
|
| issn |
1726-3255 |
| url |
https://nasplib.isofts.kiev.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 назв. — англ. |
| work_keys_str_mv |
AT malliks isodualandselfdualcodesfromgraphs AT yildizb isodualandselfdualcodesfromgraphs |
| first_indexed |
2025-12-07T16:48:46Z |
| last_indexed |
2025-12-07T16:48:46Z |
| _version_ |
1850868893528096768 |