k-dimensional error-free deconvolution using the Fermat number transform
From MaRDI portal
Publication:1825622
DOI10.1016/0898-1221(89)90030-8zbMath0684.65121OpenAlexW2047778162MaRDI QIDQ1825622
Publication date: 1989
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(89)90030-8
inverse problemerror-free algorithmFermat number transformmodular arithmeticperiodic convolutiondiscrete deconvolution
Related Items (5)
An error-free algorithm to solve a linear system of polynomial equations ⋮ One-modulus residue arithmetic algorithm to solve linear equations exactly ⋮ Error-free deconvolution based on cyclic determinant calculation approach ⋮ Error-free algorithms to solve special and general discrete systems of linear equations ⋮ An iterative error-free algorithm to solve Vandermonde systems
Cites Work
This page was built for publication: k-dimensional error-free deconvolution using the Fermat number transform