The use of finite fields to compute convolutions

DOI10.1109/TIT.1975.1055352zbMath0299.65071OpenAlexW2154123414MaRDI QIDQ4054637

Irving S. Reed, Trieu-Kien Truong

Publication date: 1975

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

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

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40) Theory of error-correcting codes and error-detecting codes (94B99) General topics in the theory of software (68N01) Elementary number theory (11A99)

Related Items (13)

Obtaining Specified Irreducible Polynomials over Finite Fields ⋮ Even faster integer multiplication ⋮ Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) ⋮ Precise deconvolution using the Fermat number transform ⋮ Fast Fourier transformation based on number theoretic transforms ⋮ A novel approach for defining a Hilbert number transform ⋮ Cosine transforms over fields of characteristic 2 ⋮ Semi-systolic Modular Multiplier over GF(2m) ⋮ Finite field trigonometric transforms ⋮ Fractional cosine and sine transforms over finite fields ⋮ Discrete Weighted Transforms and Large-Integer Arithmetic ⋮ Group Convolutions and Matrix Transforms ⋮ Computational Complexity of Fourier Transforms Over Finite Fields

This page was built for publication: The use of finite fields to compute convolutions