Permutation decoding for binary codes from lattice graphs

DOI10.1016/j.disc.2006.06.049zbMath1141.94014OpenAlexW2024040333MaRDI QIDQ924975

Jennifer D. Key, Padmapani Seneviratne

Publication date: 29 May 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.049

zbMATH Keywords

permutation decodingt-designlattice graphPD set

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial codes (94B25) Decoding (94B35) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Binary codes from rectangular lattice graphs and permutation decoding, Codes from the line graphs of complete multipartite graphs and PD-sets, Permutation decoding of codes from generalized Paley graphs, Codes from lattice and related graphs, and permutation decoding, Binary codes of some strongly regular subgraphs of the McLaughlin graph, Hulls of codes from incidence matrices of connected regular graphs, Codes associated with circulant graphs and permutation decoding, Binary codes from the line graph of the \(n\)-cube, Partial permutation decoding for codes from finite planes, On the existence of PD-sets: algorithms arising from automorphism groups of codes, Codes from multipartite graphs and minimal permutation decoding sets, Quadratic residue codes, rank three groups and PBIBDs

Uses Software

• Magma

Cites Work

• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Permutation decoding for the binary codes from triangular graphs.
• Designs and codes: An update
• Binary codes of strongly regular graphs
• On coverings
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item