Majority coset decoding

DOI10.1109/18.256518zbMath0783.94022OpenAlexW2025536681MaRDI QIDQ4277172

Iwan M. Duursma

Publication date: 6 March 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.256518

zbMATH Keywords

algebraic-geometric codesalgebraic decodingcoset decoding

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Related Items (11)

Minimum distance of Hermitian two-point codes ⋮ Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes ⋮ Decoding of differential AG codes ⋮ The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting ⋮ The theta divisor of a Jacobian variety and the decoding of geometric Goppa codes ⋮ Coset bounds for algebraic geometric codes ⋮ Feng-Rao decoding of primary codes ⋮ On decoding by error location and dependent sets of error positions ⋮ Distance bounds for algebraic geometric codes ⋮ A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II ⋮ Decoding algebraic geometry codes by a key equation

This page was built for publication: Majority coset decoding