Isodual and self-dual codes from graphs

dc.contributor.author	Mallik, S.
dc.contributor.author	Yildiz, B.
dc.date.accessioned	2023-03-12T18:11:20Z
dc.date.available	2023-03-12T18:11:20Z
dc.date.issued	2021
dc.identifier.citation	Isodual and self-dual codes from graphs / S. Mallik, B. Yildiz // Algebra and Discrete Mathematics. — 2021. — Vol. 32, № 1. — С. 49–64. — Бібліогр.: 15 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	DOI:10.12958/adm1645
dc.identifier.other	2020 MSC: 94B05, 94B25.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/188717
dc.description.abstract	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.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Isodual and self-dual codes from graphs	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA