Partial permutation decoding for codes from finite planes

DOI10.1016/j.ejc.2004.04.007zbMath1074.94014OpenAlexW2041775851MaRDI QIDQ1775031

T. P. McDonough, Vassili C. Mavron, Jennifer D. Key

Publication date: 4 May 2005

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.04.007

zbMATH Keywords

\(s\)-PD-setscodes from Desarguesian projective and affine planes

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Combinatorial codes (94B25) Decoding (94B35)

Related Items

Binary codes from rectangular lattice graphs and permutation decoding, Codes from the line graphs of complete multipartite graphs and PD-sets, Codes from lattice and related graphs, and permutation decoding, Codes associated with the odd graphs, Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even, Special \textit{LCD} codes from products of graphs, Codes from incidence matrices of graphs, Information sets in abelian codes: defining sets and Groebner basis, Hulls of codes from incidence matrices of connected regular graphs, New advances in permutation decoding of first-order Reed-Muller codes, Partial permutation decoding for MacDonald codes, Improved partial permutation decoding for Reed-Muller codes, On linear codes admitting large automorphism groups, Codes from incidence matrices and line graphs of Hamming graphs, Information sets and partial permutation decoding for codes from finite geometries, Binary codes from the line graph of the \(n\)-cube, Reed-Muller codes and permutation decoding, Codes from the incidence matrices of graphs on 3-sets, On the existence of PD-sets: algorithms arising from automorphism groups of codes, \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\), Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\), Partial permutation decoding for the first-order Reed-Muller codes, Graphs, designs and codes related to the \(n\)-cube, Binary codes from Paley graphs of prime-power-square order, Binary codes from reflexive uniform subset graphs on 3-sets

Uses Software

• GAP
• Magma

Cites Work

• Permutation decoding for binary codes from lattice graphs
• Bruck nets, codes, and characters of loops
• Permutation decoding for the binary codes from triangular graphs.
• Dual codes of translation planes
• Some \(p\)-ranks related to orthogonal spaces
• Minimum weight and dimension formulas for some geometric codes
• 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