Information sets and partial permutation decoding for codes from finite geometries
From MaRDI portal
Publication:2490139
DOI10.1016/j.ffa.2005.05.007zbMath1089.94044OpenAlexW2093434772MaRDI QIDQ2490139
T. P. McDonough, Jennifer D. Key, Vassili C. Mavron
Publication date: 28 April 2006
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2005.05.007
Combinatorial aspects of block designs (05B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Linear codes and caps in Galois spaces (51E22) Combinatorial aspects of finite geometries (05B25) 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, Permutation decoding of codes from generalized Paley graphs, Codes associated with the odd graphs, Fast systematic encoding of multiplicity codes, 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, Codes and designs from triangular graphs and their line graphs, Partial permutation decoding for MacDonald codes, Improved partial permutation decoding for Reed-Muller codes, Codes from incidence matrices and line graphs of Hamming graphs, 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, Antiblocking decoding, On the existence of PD-sets: algorithms arising from automorphism groups of codes, Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\), A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers, Partial permutation decoding for the first-order Reed-Muller codes, Codes from incidence matrices of some regular graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bruck nets, codes, and characters of loops
- Bases of minimum-weight vectors for codes from designs
- Partial permutation decoding for codes from finite planes
- On coverings
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes