Constructions of binary codes based on bipartite graphs

DOI10.1007/S11786-016-0258-0MaRDI QIDQ2630779zbMATH OpenOpenAlexFDO

Authors Denis C. K. Wong

Publication date 22 July 2016

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-016-0258-0

zbMATH Keywords

bipartite graphslinear codesminimum distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Recommendations

• Some combinatorial aspects of constructing bipartite-graph codes
• scientific article; zbMATH DE number 975345
• Constructing self-dual codes using graphs
• Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
• Isodual and self-dual codes from graphs

Cites work

• Error correction coding. Mathematical methods and algorithms
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• scientific article; zbMATH DE number 1270594 (Why is no real title available?)
• scientific article; zbMATH DE number 3394154 (Why is no real title available?)

Cited in

(6)

• Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
• Some combinatorial aspects of constructing bipartite-graph codes
• scientific article; zbMATH DE number 5300021 (Why is no real title available?)
• Bi-resolving graph homomorphisms and extensions of bi-closing codes
• scientific article; zbMATH DE number 975345 (Why is no real title available?)
• Discriminating codes in (bipartite) planar graphs

This page was built for publication: Constructions of binary codes based on bipartite graphs

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