On the factorization of polynomials and direct sum properties in integer polynomial rings

DOI10.1007/BF01182595zbMath0858.68024OpenAlexW2054848992MaRDI QIDQ1922613

Hari Krishna Garg

Publication date: 5 November 1996

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01182595

zbMATH Keywords

Chinese remainder theoremcomputational algorithms for processing sequences

Mathematics Subject Classification ID

Searching and sorting (68P10) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Information theory (general) (94A15)

Related Items (3)

The AICE-CRT and digital signal processing algorithms: The complex case ⋮ On algorithms for digital signal processing of sequences ⋮ Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

Cites Work

• Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings
• The AICE-CRT and digital signal processing algorithms: The complex case
• The generalized discrete Fourier transform in rings of algebraic integers
• Convolutions of long integer sequences by means of number theoretic transforms over residue class polynomial rings
• The Discrete Fourier Transform Over Finite Rings with Application to Fast Convolution
• Rings, fields, the Chinese remainder theorem and an extension-Part I: theory
• Rings, fields, the Chinese remainder theorem and an extension-Part II: applications to digital signal processing
• Discrete Convolutions via Mersenne Transforms

This page was built for publication: On the factorization of polynomials and direct sum properties in integer polynomial rings