Majority coset decoding

DOI10.1109/18.256518MaRDI QIDQ4277172zbMATH OpenOpenAlexFDO

Authors Iwan 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 decodingalgebraic-geometric codescoset decoding

Mathematics Subject Classification ID

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

Recommendations

• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• Decoding algebraic geometry codes by a key equation
• scientific article; zbMATH DE number 493096
• Decoding algebraic-geometric codes up to the designed minimum distance
• On the decoding of algebraic-geometric codes

Cited in

(16)

• On one modification of the majority decoding algorithm
• On decoding by error location and dependent sets of error positions
• 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
• The theta divisor of a Jacobian variety and the decoding of geometric Goppa codes
• Feng-Rao decoding of primary codes
• Minimum distance of Hermitian two-point codes
• Decoding of differential AG codes
• Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
• Generalized coset decoding
• Distance bounds for algebraic geometric codes
• Note on majority-logic decoding of finite geometry codes (Corresp.)
• Syndrome series of one point algebraic-geometric codes and majority voting scheme
• Coset bounds for algebraic geometric codes
• Duals of multiplicity codes
• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting

This page was built for publication: Majority coset decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277172)