Codes from lattice and related graphs, and permutation decoding

DOI10.1016/j.dam.2010.07.003zbMath1227.94083OpenAlexW1991819817MaRDI QIDQ602759

Jennifer D. Key, Bernardo Gabriel Rodrigues

Publication date: 5 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.07.003

zbMATH Keywords

codesline graphspermutation decodinglattice graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Codes associated with the odd graphs, A characterization of graphs by codes from their incidence matrices, Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1), Codes from incidence matrices of graphs, Hulls of codes from incidence matrices of connected regular graphs, Codes from incidence matrices and line graphs of Hamming graphs, Codes from the incidence matrices of graphs on 3-sets, On the existence of PD-sets: algorithms arising from automorphism groups of codes, Codes from incidence matrices of some Bouwer graphs, Codes from incidence matrices of some regular graphs, Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes associated with triangular graphs and permutation decoding
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Binary codes from rectangular lattice graphs and permutation decoding
• Permutation decoding for binary codes from lattice graphs
• Codes from incidence matrices and line graphs of Hamming graphs
• Binary codes from the line graph of the \(n\)-cube
• The Magma algebra system. I: The user language
• Permutation decoding for the binary codes from triangular graphs.
• On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
• Partial permutation decoding for codes from finite planes
• Binary codes of strongly regular graphs
• On coverings
• PD-sets for the codes related to some classical varieties
• Codes from the line graphs of complete multipartite graphs and PD-sets
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Congruent Graphs and the Connectivity of Graphs
• Permutation Decoding of Systematic Codes