The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis

DOI10.1080/00207219108925501zbMath0735.94009OpenAlexW2051996933MaRDI QIDQ3984332

T. Aaron Gulliver, Micaela Serra, Vijay K. Bhargava

Publication date: 27 June 1992

Published in: International Journal of Electronics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207219108925501

zbMATH Keywords

primitive polynomialsGalois fieldBCH error correcting code decodingdigital testing of integrated circuitspower residue codesquasi-cycles codesVLSI implementation of multiplication and inverse operations

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Fault detection; testing in circuits and networks (94C12) Cyclic codes (94B15)

Related Items (2)

Primitive Normal Polynomials Over Finite Fields ⋮ \(q\)-ary Gray codes and weight distributions

Cites Work

• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• An updated table of minimum-distance bounds for binary linear codes
• Some results on quasi-cyclic codes
• Circulant bases for cyclic codes (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis