Unique Decoding of Hyperderivative Reed-Solomon Codes
By: Haojie Gu, Jun Zhang
Potential Business Impact:
Fixes errors in messages sent over bad connections.
Error-correcting codes are combinatorial objects designed to cope with the problem of reliable transmission of information on a noisy channel. A fundamental problem in coding theory and practice is to efficiently decode the received word with errors to obtain the transmitted codeword. In this paper, we consider the decoding problem of Hyperderivative Reed-Solomon (HRS) codes with respect to the NRT metric. Specifically, we propose a Welch-Berlekamp algorithm for the unique decoding of NRT HRS codes.
Similar Papers
Generalized Hyperderivative Reed-Solomon Codes
Information Theory
Makes data storage more reliable and efficient.
Improved Receiver Chain Performance via Error Location Inference
Information Theory
Improves space messages by fixing errors better.
List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
Information Theory
Fixes data errors in more ways.