Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes

DOI10.1016/j.tcs.2013.10.025zbMath1350.94068OpenAlexW2074721324MaRDI QIDQ391770

Ferruh Özbudak, Oğuz Yayla

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.10.025

zbMATH Keywords

Reed-Solomon codesfolded Hermitian codesinterleaved Reed-Solomon codessimultaneous polynomial reconstruction

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Highly resilient correctors for polynomials
• Hermitian codes as generalized Reed-Solomon codes
• On the Structure of Hermitian Codes and Decoding for Burst Errors
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• A note on Hermitian codes over GF(q/sup 2/)
• Decoding algebraic-geometric codes up to the designed minimum distance
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
• Algebraic Soft-Decision Decoding of Hermitian Codes
• Coding and Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes