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

DOI10.1109/18.104343zbMath0742.94011OpenAlexW1968780988MaRDI QIDQ3987477

Douglas 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 polynomialdual basesfeedback shift registerirreducible 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)

Related Items (3)

Almost weakly self-dual bases for finite fields ⋮ A new characterization of dual bases in finite fields and its applications ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

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