Majority coset decoding
From MaRDI portal
Publication:4277172
DOI10.1109/18.256518zbMath0783.94022MaRDI QIDQ4277172
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
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
94B35: Decoding
Related Items
Decoding of differential AG codes, Distance bounds for algebraic geometric codes, Coset bounds for algebraic geometric codes, The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting, 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, Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes