The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
From MaRDI portal
Publication:862559
DOI10.1007/s00200-006-0015-8zbMath1134.94396OpenAlexW2093877555WikidataQ57728742 ScholiaQ57728742MaRDI QIDQ862559
Michael E. O'Sullivan, Maria Bras-Amorós
Publication date: 24 January 2007
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-006-0015-8
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)
Related Items
Polynomial-division-based algorithms for computing linear recurrence relations, Algebraic-geometry codes, one-point codes, and evaluation codes, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, Generalizing strong admissibility of patterns of numerical semigroups, Sparse FGLM algorithms, List decoding algorithm based on voting in Gröbner bases for general one-point AG codes, Redundancies of correction capability optimized Reed-Muller codes, On numerical semigroups and the redundancy of improved codes correcting generic errors, Weierstrass semigroup at \(m+1\) rational points in maximal curves which cannot be covered by the Hermitian curve, NONHOMOGENEOUS PATTERNS ON NUMERICAL SEMIGROUPS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension of the Berlekamp-Massey algorithm to N dimensions
- On decoding by error location and dependent sets of error positions
- Weierstrass semigroups in an asymptotically good tower of function fields
- On the asymptotic behaviour of some towers of function fields over finite fields
- Arf numerical semigroups.
- On the parameters of algebraic-geometry codes related to Arf semigroups
- Maximality properties in numerical semigroups and applications to one-dimensional analytically irreducible local domains
- Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng–Rao Improvements
- A note on Hermitian codes over GF(q/sup 2/)
- Decoding algebraic-geometric codes up to the designed minimum distance
- Majority coset decoding
- Improvements to Evaluation Codes and New Characterizations of Arf Semigroups
- Footprints or generalized Bezout's theorem
- Performance analysis of a decoding algorithm for algebraic-geometry codes
- Improved geometric Goppa codes. I. Basic theory
- Decoding of codes defined by a single point on a curve
- Stable Ideals and Arf Rings
- Une Interprétation Algébrique de la Suite des Ordres de Multiplicité D'une Branche Algébrique
- New codes for the Berlekamp-Massey-Sakata algorithm
