The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions

DOI10.1109/TIT.1978.1055816zbMath0371.94038OpenAlexW2054917999MaRDI QIDQ4149662

Robert A. Scholtz, Trieu-Kien Truong, Irving S. Reed, Lloyd R. Welch

Publication date: 1978

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

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

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Numerical methods for trigonometric approximation and interpolation (65T40) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (3)

Fraud and data availability proofs: detecting invalid blocks in light clients ⋮ Quadratic-residue codes and cyclotomic fields ⋮ Refined convergents to the associated continued fractions for binary sequences

This page was built for publication: The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions