6 Reed-Solomon and Algebraic-Geometric Codes
The previous several chapters investigated the combinatorics of list decoding and indicated what fraction of errors one can hope to correct with small lists, as a function of the distance and rate of the code. This indicates the “combinatorial” feasibility of list decoding, but provides no way to turn this into an efficient (polynomial time) algorithm that outputs the small list of codewords that differ from a received word in a certain number of positions.
KeywordsPolynomial Time Alphabet Size Weighted Degree Modular Curf Alternant Code
Unable to display preview. Download preview PDF.