A new structured design method for convolutions over finite fields, Part I

DOI10.1109/TIT.1983.1056705zbMATH Open0505.68024OpenAlexW1965217510MaRDI QIDQ4742312FDOQ4742312

Authors: Meghanad D. Wagh, Salvatore D. Morgera Error creating thumbnail:

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1983.1056705

zbMATH Keywords

multiplicative complexitydecoding of Reed-Solomon codesbilinear cyclic convolution algorithms

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Decoding (94B35) Algorithms in computer science (68W99)

Cited In (5)

• On arithmetical algorithms over finite fields
• Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields
• Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
• Special algorithms for convolutions over Galois fields
• On a signal processing algorithms based class of linear codes

This page was built for publication: A new structured design method for convolutions over finite fields, Part I

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