2014/06/03 by Mostafa Hosni Mohamed, Mohamed, Mostafa Hosni, Nielsen, Johan S. R. +2
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1406.0688
openalex publication_date 2014/06/03 · openalex created_date 2022/09/03 · openalex updated_date 2026/07/28
We decode Reed-Solomon codes using soft information provided at the receiver.\nThe Extended Euclidean Algorithm (EEA) is considered as an initial step to\nobtain an intermediate result. The final decoding result is obtained by\ninterpolating the output of the EEA at the least reliable positions of the\nreceived word. We refer to this decoding method as reduced list-decoding, since\nnot all received positions are used in the interpolation as in other\nlist-decoding methods, such as the Guruswami-Sudan and Wu algorithms.\nConsequently the complexity of the interpolation step is reduced considerably.\nThe probability of failure can be minimised by adjusting certain parameters,\nmaking it comparable with the K "otter-Vardy algorithm but having a much lower\ncomplexity.\n