2013/11/08 by Johan S. R. Nielsen, Nielsen, Johan S. R.
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1311.1940
This is a major revision of the previous version: it contains a new bound on the failure probability, while some previous parts have been considerably shortened. Submitted to ICMCTA 2014
openalex publication_date 2013/11/08 · arxiv created 2014/05/21 · arxiv updated 2014/05/22 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
Power decoding, or "decoding by virtual interleaving", of Reed--Solomon codes is a method for unique decoding beyond half the minimum distance. We give a new variant of the Power decoding scheme, building upon the key equation of Gao. We show various interesting properties such as behavioural equivalence to the classical scheme using syndromes, as well as a new bound on the failure probability when the powering degree is 3.