Redundancies of correction capability optimized Reed-Muller codes

DOI10.1016/j.dam.2008.01.004zbMath1157.94375arXivcs/0609160OpenAlexW2090614816WikidataQ57728720 ScholiaQ57728720MaRDI QIDQ1005243

Maria Bras-Amorós, Michael E. O'Sullivan

Publication date: 9 March 2009

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

Full work available at URL: https://arxiv.org/abs/cs/0609160

zbMATH Keywords

Reed-Muller codeFeng-Rao improved code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
• On decoding by error location and dependent sets of error positions
• A simple approach for construction of algebraic-geometric codes from affine plane curves
• Performance analysis of a decoding algorithm for algebraic-geometry codes
• Improved geometric Goppa codes. I. Basic theory
• The minimum distance of codes in an array coming from telescopic semigroups
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Redundancies of correction capability optimized Reed-Muller codes