Vlsi designs for multiplication over finite fields GF(2m)
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 297-309
- https://doi.org/10.1007/3-540-51083-4_67
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, 1985
- Systolic Multipliers for Finite Fields GF(2m)IEEE Transactions on Computers, 1984
- A Universal Reed-Solomon DecoderIBM Journal of Research and Development, 1984
- Architecture for VLSI Design of Reed-Solomon DecodersIEEE Transactions on Computers, 1984
- Introduction to Coding TheoryPublished by Springer Nature ,1982
- A Cellular-Array Multiplier for GF(2m)IEEE Transactions on Computers, 1971
- Inversionless decoding of binary BCH codesIEEE Transactions on Information Theory, 1971
- On primitive trinomials (Mod 2)Information and Control, 1968
- Computation with finite fieldsInformation and Control, 1963