On bit-serial multiplication and dual bases in GF(2/sup m/)

DOI10.1109/18.104343MaRDI QIDQ3987477zbMATHOpenAlexFDO

Authors D. R. Stinson

Publication date 28 June 1992

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

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

zbMATH Keywords

minimal polynomialfeedback shift registerdual basesirreducible trinomialbasis matrixbit- serial multiplicationdual bases in finite fields

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Finite fields (field-theoretic aspects) (12E20) Special polynomials in general fields (12E10)

Recommendations

• Dual bases and bit-serial multiplication in \(\mathbb F_q^n\).
• GF(2/sup m/) multiplication and division over the dual basis
• Optimal normal bases in \(GF(p^ n)\)
• Self-dual bases in \(\mathbb{F}_{q^ n}\)

Cited in

(15)

• scientific article; zbMATH DE number 1689040 (Why is no real title available?)
• A dual basis bit-serial systolic multiplier for GF(2 )
• GF(2/sup m/) multiplication and division over the dual basis
• A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials
• On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
• Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• A new characterization of dual bases in finite fields and its applications
• scientific article; zbMATH DE number 17852 (Why is no real title available?)
• Theory Is Forever
• scientific article; zbMATH DE number 1941247 (Why is no real title available?)
• Almost weakly self-dual bases for finite fields
• Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over <inline-formula> <tex-math notation="LaTeX">$GF(2^{m})$</tex-math> </inline-formula> Using Generalized <inline-formula> <tex-math notation="LaTeX">$(a, b)$</tex-math> </inline-formula>-Way Karatsuba Algorithm”
• Bit Serial Multiplication in Finite Fields
• Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields

This page was built for publication: On bit-serial multiplication and dual bases in GF(2/sup m/)

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