Redundancies of correction capability optimized Reed-Muller codes
From MaRDI portal
Publication:1005243
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1284423 (Why is no real title available?)
- scientific article; zbMATH DE number 503203 (Why is no real title available?)
- scientific article; zbMATH DE number 2081133 (Why is no real title available?)
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Improved geometric Goppa codes. I. Basic theory
- On decoding by error location and dependent sets of error positions
- Performance analysis of a decoding algorithm for algebraic-geometry codes
- The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
- The minimum distance of codes in an array coming from telescopic semigroups
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)