Bit Level Soft Decision Decoding of Triple Parity Reed Solomon Codes\n through Automorphism Groups

2013/03/16 by Vo Tam Van, Seiichi Mita, Van, Vo Tam +9
Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1303.3965

openalex publication_date 2013/03/16 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

This paper discusses bit-level soft decoding of triple-parity Reed-Solomon\n(RS) codes through automorphism permutation. A new method for identifying the\nautomorphism groups of RS binary images is first developed. The new algorithm\nruns effectively, and can handle more RS codes and capture more automorphism\ngroups than the existing ones. Utilizing the automorphism results, a new\nbit-level soft-decision decoding algorithm is subsequently developed for\ngeneral (n,n-3,4) RS codes. Simulation on (31,28,4) RS codes demonstrates\nan impressive gain of more than 1 dB at the bit error rate of 10^-5 over\nthe existing algorithms.\n

Related

• Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information
• Constituent automorphism decoding of Reed-Muller codes
• New Algebraic Soft Decision Decoding Algorithm for Reed-Solomon Code
• Performance Analysis of Algebraic Soft Decoding of Reed-Solomon Codes over Binary Symmetric and Erasure Channels
• Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes