Rings, fields, the Chinese remainder theorem and an extension-Part I: theory

DOI10.1109/82.329735zbMath0829.65137OpenAlexW2100128294MaRDI QIDQ4849365

No author found.

Publication date: 25 January 1996

Published in: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

finite fieldspolynomial ringsdigital signal processingChinese remainder theoremnumber-theoretic transformsinteger ringsAmerican-Indian-Chinese extensionword and sequence length constraints

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (6)

The AICE-CRT and digital signal processing algorithms: The complex case ⋮ On the factorization of polynomials and direct sum properties in integer polynomial rings ⋮ On algorithms for digital signal processing of sequences ⋮ Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system ⋮ Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system ⋮ Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

This page was built for publication: Rings, fields, the Chinese remainder theorem and an extension-Part I: theory