Constructing self-dual codes using graphs

DOI10.1016/0095-8956(91)90066-SMaRDI QIDQ1179477zbMATH OpenOpenAlexFDO

Authors Haluk Oral

Publication date 26 June 1992

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(91)90066-s

zbMATH Keywords

self-dual codeself-orthogonal codeincidence matrixcubic planar bipartite graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 1028232
• Isodual and self-dual codes from graphs
• On graphs and codes
• Eulerian Self-Dual Codes

Cites work

• scientific article; zbMATH DE number 3756373 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3394154 (Why is no real title available?)
• (v, k, λ) Configurations and self-dual codes
• A classification of self-orthogonal codes over GF(2)
• Hadamard matrices and doubly even self-dual error-correcting codes

Cited in

(8)

• Self-dual codes defined on factor graphs
• Construction of self dual codes from graphs
• scientific article; zbMATH DE number 6769199 (Why is no real title available?)
• The neighbor graph of binary self-dual codes
• Self-dual codes from 3-class association schemes
• Constructions of binary codes based on bipartite graphs
• Isodual and self-dual codes from graphs
• On graphs and codes

This page was built for publication: Constructing self-dual codes using graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179477)