Title: Decoding binary expansions of low-rate Reed-Solomon codes far beyond the BCH bound
Abstract:Binary expansions of low-rate Reed-Solomon codes typically are capable of correcting far more binary errors than guaranteed by the BCH bound on the Reed-Solomon code. Practical decoding algorithms tha...Binary expansions of low-rate Reed-Solomon codes typically are capable of correcting far more binary errors than guaranteed by the BCH bound on the Reed-Solomon code. Practical decoding algorithms that often correct beyond the true minimum distances of the binary codes are described.Read More
Publication Year: 2002
Publication Date: 2002-11-19
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot