Binary codes from rectangular lattice graphs and permutation decoding
From MaRDI portal
Publication:854813
DOI10.1016/j.ejc.2005.09.001zbMath1105.94018OpenAlexW1982311311MaRDI QIDQ854813
Jennifer D. Key, Padmapani Seneviratne
Publication date: 7 December 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.09.001
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Decoding (94B35)
Related Items
Codes from the line graphs of complete multipartite graphs and PD-sets, Codes from lattice and related graphs, and permutation decoding, Binary codes from the line graph of the \(n\)-cube, Automorphism groups of cyclic codes, On the existence of PD-sets: algorithms arising from automorphism groups of codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutation decoding for binary codes from lattice graphs
- Permutation decoding for the binary codes from triangular graphs.
- Partial permutation decoding for codes from finite planes
- On coverings
- Information sets and partial permutation decoding for codes from finite geometries
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes