Isodual and self-dual codes from graphs

S. Mallik; B. Yildiz

doi:10.12958/adm1645

Isodual and self-dual codes from graphs

S. Mallik, B. Yildiz

Informatics, Computing, and Cyber Systems, School of

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Binary linear codes are constructed from graphs, in particular, by the generator matrix[I_n|A] whereAis 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.

Original language	English (US)
Pages (from-to)	49-64
Number of pages	16
Journal	Algebra and Discrete Mathematics
Volume	32
Issue number	1
DOIs	https://doi.org/10.12958/adm1645
State	Published - 2021

Keywords

Adjacency matrix
Graphs
Isodual codes
Self-dual codes
Strongly regular graphs

ASJC Scopus subject areas

Algebra and Number Theory
Discrete Mathematics and Combinatorics

Access to Document

10.12958/adm1645

Cite this

@article{9770f7b02d3d46428da90f427af95b37,

title = "Isodual and self-dual codes from graphs",

abstract = "Binary linear codes are constructed from graphs, in particular, by the generator matrix[In|A] whereAis 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.",

keywords = "Adjacency matrix, Graphs, Isodual codes, Self-dual codes, Strongly regular graphs",

author = "S. Mallik and B. Yildiz",

note = "Publisher Copyright: {\textcopyright} Algebra and Discrete Mathematics.",

year = "2021",

doi = "10.12958/adm1645",

language = "English (US)",

volume = "32",

pages = "49--64",

journal = "Algebra and Discrete Mathematics",

issn = "1726-3255",

publisher = "Institute of Applied Mathematics And Mechanics of the National Academy of Sciences of Ukraine",

number = "1",

}

TY - JOUR

T1 - Isodual and self-dual codes from graphs

AU - Mallik, S.

AU - Yildiz, B.

N1 - Publisher Copyright: © Algebra and Discrete Mathematics.

PY - 2021

Y1 - 2021

N2 - Binary linear codes are constructed from graphs, in particular, by the generator matrix[In|A] whereAis 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.

AB - Binary linear codes are constructed from graphs, in particular, by the generator matrix[In|A] whereAis 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.

KW - Adjacency matrix

KW - Graphs

KW - Isodual codes

KW - Self-dual codes

KW - Strongly regular graphs

UR - http://www.scopus.com/inward/record.url?scp=85119117031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85119117031&partnerID=8YFLogxK

U2 - 10.12958/adm1645

DO - 10.12958/adm1645

M3 - Article

AN - SCOPUS:85119117031

SN - 1726-3255

VL - 32

SP - 49

EP - 64

JO - Algebra and Discrete Mathematics

JF - Algebra and Discrete Mathematics

IS - 1

ER -

Isodual and self-dual codes from graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this