Constructing self-dual codes using graphs

DOI10.1016/0095-8956(91)90066-SzbMATH Open0745.05033OpenAlexW1993662888MaRDI QIDQ1179477FDOQ1179477

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A classification of self-orthogonal codes over GF(2)
• Title not available (Why is that?)
• Hadamard matrices and doubly even self-dual error-correcting codes
• (v, k, λ) Configurations and self-dual codes

Cited In (8)

• Self-dual codes defined on factor graphs
• Construction of self dual codes from graphs
• Title not available (Why is that?)
• 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)