On the complexity of decoding Reed-Solomon codes (Corresp.)

DOI10.1109/TIT.1976.1055516zbMath0318.94017OpenAlexW1966214710MaRDI QIDQ4081130

Jørn Justesen

Publication date: 1976

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1976.1055516

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (7)

Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta }{ \langle u^2 \rangle} \)] ⋮ The complexity of error-correcting codes ⋮ Negacyclic codes of prime power length over the finite non-commutative chain ring 𝔽pm[u,𝜃 〈u2〉] ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ PCPs and the hardness of generating synthetic data ⋮ Optimal Las Vegas reduction from one-way set reconciliation to error correction ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes

This page was built for publication: On the complexity of decoding Reed-Solomon codes (Corresp.)