Computing error distance of Reed-Solomon codes

DOI10.1007/978-3-642-29952-0_24MaRDI QIDQ2898032zbMATH OpenOpenAlexFDO

Authors Guizhen Zhu, Daqing Wan

Publication date 16 July 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29952-0_24

zbMATH Keywords

character sumdeep holedistinct coordinates countingReed-Solomon code

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial codes (94B25)

Recommendations

• On error distance of Reed-Solomon codes
• On Reed-Solomon codes
• Error distance of standard Reed-Solomon codes
• On the error distance of extended Reed-Solomon codes
• Remark on conjecture of deep holes of standard Reed-Solomon code

Cited in

(9)

• On error distance of Reed-Solomon codes
• Some results on ordinary words of standard Reed-Solomon codes
• Deep holes in Reed-Solomon codes based on Dickson polynomials
• Error distance of standard Reed-Solomon codes
• On the error distance of extended Reed-Solomon codes
• Counting polynomials with distinct zeros in finite fields
• Distance Distribution in Reed-Solomon Codes
• Deep holes of twisted Reed-Solomon codes
• Counting polynomials with distinct zeros in Galois ring \(\mathrm{GR}(p^2,r)\)

This page was built for publication: Computing error distance of Reed-Solomon codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898032)