Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields

DOI10.1007/BF01812210zbMath0714.94003MaRDI QIDQ751615

Salvatore D. Morgera

Publication date: 1990

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

zbMATH Keywords

finite fieldscyclic convolution algorithmsefficient digital signal processing algorithmslinear algebraic error- correcting codesmultiplicative complexity of bilinear algorithmsprime factor algorithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of multiplication in finite fields
• New algorithms for digital convolution
• A new approach to error-correcting codes
• On Computing the Discrete Fourier Transform
• A prime factor FFT algorithm using high-speed convolution
• A new structured design method for convolutions over finite fields, Part I

This page was built for publication: Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields