Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes
From MaRDI portal
Publication:2497694
DOI10.1016/j.chaos.2005.08.081zbMath1100.94012OpenAlexW2001040901MaRDI QIDQ2497694
Publication date: 4 August 2006
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2005.08.081
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Numerical methods for discrete and fast Fourier transforms (65T50) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Source coding (94A29)
Cites Work