Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields

DOI10.1007/BF01812210zbMATH Open0714.94003MaRDI QIDQ751615FDOQ751615

Salvatore D. Morgera

Publication date: 1990

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

Recommendations

• Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
• scientific article
• Algorithms and structures for convolutions over Galois fields
• On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
• On multiplication in finite fields

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• A new approach to error-correcting codes
• New algorithms for digital convolution
• Title not available (Why is that?)
• On the complexity of multiplication in finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Cited In (3)

• On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
• On the bounds of the bilinear complexity of multiplication in some finite fields
• Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751615)