Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes
From MaRDI portal
Fast algorithm for ``error-free'' convolution computation using Mersenne--Lucas codes
Source coding (94A29) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) 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) Numerical methods for discrete and fast Fourier transforms (65T50)
Recommendations
- A new algorithm of fast Mersenne-transform and the application in calculating convolution
- Fast Computations of Gröbner Bases and Blind Recognitions of Convolutional Codes
- A fast algorithm for computing distance spectrum of convolutional codes
- Fast algorithms for erasures and error correction in redundant residue number systems
- Convolutional codes. An algebraic approach
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- scientific article; zbMATH DE number 4164732
- scientific article; zbMATH DE number 4070804
- Fault-Tolerant Convolution Via Chinese Remainder Codes Constructed From Non-Coprime Moduli
- On theory and fast algorithms for error correction in residue number system product codes
Cites work
- scientific article; zbMATH DE number 3131972 (Why is no real title available?)
- scientific article; zbMATH DE number 3928865 (Why is no real title available?)
- scientific article; zbMATH DE number 3967873 (Why is no real title available?)
- scientific article; zbMATH DE number 107985 (Why is no real title available?)
- scientific article; zbMATH DE number 1222520 (Why is no real title available?)
- scientific article; zbMATH DE number 194969 (Why is no real title available?)
- scientific article; zbMATH DE number 3363560 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- Discrete Convolutions via Mersenne Transforms
- Fast multiplication of large numbers
Cited in
(1)
This page was built for publication: Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497694)