|
Эта публикация цитируется в 1 научной статье (всего в 1 статье)
RESEARCH ARTICLE
Isodual and self-dual codes from graphs
S. Mallik, B. Yildiz Department of Mathematics and Statistics, Northern Arizona University, 801 S. Osborne Dr. PO Box: 5717, Flagstaff, AZ 86011, USA
Аннотация:
Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n\mid 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.
Ключевые слова:
self-dual codes, isodual codes, graphs, adjacency matrix, strongly regular graphs.
Поступила в редакцию: 17.06.2020 Исправленный вариант: 24.02.2021
Образец цитирования:
S. Mallik, B. Yildiz, “Isodual and self-dual codes from graphs”, Algebra Discrete Math., 32:1 (2021), 49–64
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/adm806 https://www.mathnet.ru/rus/adm/v32/i1/p49
|
Статистика просмотров: |
Страница аннотации: | 38 | PDF полного текста: | 29 | Список литературы: | 11 |
|