Computing Error Distance of Reed-Solomon Codes

DOI10.1007/978-3-642-29952-0_24zbMath1350.94067OpenAlexW107280146MaRDI QIDQ2898032

Daqing Wan, Guizhen Zhu

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 sumReed-Solomon codedeep holedistinct coordinates counting

Mathematics Subject Classification ID

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

Related Items (5)

Some results on ordinary words of standard Reed-Solomon codes ⋮ Deep holes in Reed-Solomon codes based on Dickson polynomials ⋮ On the error distance of extended Reed-Solomon codes ⋮ Counting subset sums of finite Abelian groups ⋮ Counting polynomials with distinct zeros in finite fields

This page was built for publication: Computing Error Distance of Reed-Solomon Codes