A fast algorithm to compute irreducible and primitive polynomials in finite fields
From MaRDI portal
Publication:4327377
DOI10.1007/BF01294593zbMath0839.11069MaRDI QIDQ4327377
Publication date: 5 April 1995
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Cites Work
- Constructing normal bases in finite fields
- Systolic VLSI Arrays for Polynomial GCD Computation
- Finding Isomorphisms Between Finite Fields
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
- A method for solving key equation for decoding goppa codes
- Shift-register synthesis and BCH decoding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item