Redundancies of correction capability optimized Reed-Muller codes
From MaRDI portal
Publication:1005243
DOI10.1016/J.DAM.2008.01.004zbMATH Open1157.94375DBLPjournals/dam/Bras-AmorosO08arXivcs/0609160OpenAlexW2090614816WikidataQ57728720 ScholiaQ57728720MaRDI QIDQ1005243FDOQ1005243
Authors: Maria Bras-Amorós, Michael E. O'Sullivan
Publication date: 9 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: This article is focused on some variations of Reed-Muller codes that yield improvements to the rate for a prescribed decoding performance under the Berlekamp-Massey-Sakata algorithm with majority voting. Explicit formulas for the redundancies of the new codes are given.
Full work available at URL: https://arxiv.org/abs/cs/0609160
Recommendations
Cites Work
- On decoding by error location and dependent sets of error positions
- Title not available (Why is that?)
- The minimum distance of codes in an array coming from telescopic semigroups
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Improved geometric Goppa codes. I. Basic theory
- Title not available (Why is that?)
- Performance analysis of a decoding algorithm for algebraic-geometry codes
- The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Redundancies of correction capability optimized Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005243)