Reed-Muller codes and permutation decoding
From MaRDI portal
Publication:712223
DOI10.1016/j.disc.2009.06.001zbMath1226.94020OpenAlexW2048870136MaRDI QIDQ712223
T. P. McDonough, Jennifer D. Key, Vassili C. Mavron
Publication date: 28 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.06.001
Related Items
Permutation decoding of codes from generalized Paley graphs, Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes, Some algebraic questions about the Reed-Muller code, New advances in permutation decoding of first-order Reed-Muller codes, Improved partial permutation decoding for Reed-Muller codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial permutation decoding for the first-order Reed-Muller codes
- Partial permutation decoding for codes from finite planes
- On coverings
- PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
- Information sets and partial permutation decoding for codes from finite geometries
- PD-sets for the codes related to some classical varieties
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes
