Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes

Authors:
R. Kotter
Affiliations:
Dept. of Electr. Eng., Linkoping Univ.
Venue:
IEEE Transactions on Information Theory
Year:
1996

Citing 0
Cited 10

A Systolic Array Implementation of the Feng-Rao Algorithm

IEEE Transactions on Computers
A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Implementation of a Successive Erasure BCH(16, 7, 6) Decoder and Performance Simulation by Rapid Prototyping

FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
A displacement approach to decoding algebraic codes

Contemporary mathematics
Multitrial decoding of concatenated codes using fixed thresholds

Problems of Information Transmission
Efficient interpolation in the Guruswami-Sudan algorithm

IEEE Transactions on Information Theory
A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes

Information Processing Letters
Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes

Journal of Signal Processing Systems
A minimal search soft decision list decoding algorithm for Reed-Solomon codes

International Journal of Information and Communication Technology

Quantified Score

Hi-index	754.90

Visualization

Abstract

Generalized minimum-distance (GMD) decoding is a standard soft-decoding method for block codes. We derive an efficient general GMD decoding scheme for linear block codes in the framework of error-correcting pairs. Special attention is paid to Reed-Solomon (RS) codes and one-point algebraic-geometry (AG) codes. For RS codes of length n and minimum Hamming distance d the GMD decoding complexity turns out to be in the order O(nd), where the complexity is counted as the number of multiplications in the field of concern. For AG codes the GMD decoding complexity is highly dependent on the curve in consideration. It is shown that we can find all relevant error-erasure-locating functions with complexity O(o1nd), where o1 is the size of the first nongap in the function space associated with the code. A full GMD decoding procedure for a one-point AG code can be performed with complexity O(dn2)