✦ LIBER ✦

Algebraic algorithms in GF(q)

✍ Scribed by J. Calmet

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 568 KB
Volume: 56
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90017-2

No coin nor oath required. For personal study only.

✦ Synopsis

This talk reports on joint work with R. Loos (Univ. Karlsruhe) on algebraic algorithms for computing in large Galois Fields GF(q) with q = p" where p is the characteristic of the field and may be arbitrarily large.

This work is materialized by a module of algorithms implemented in the ALDES/SACZ computer algebra system, which will be available with the next release of this system.

📜 SIMILAR VOLUMES

Normal Bases over GF(q)

✍ Yaotsu Chang; T.K Truong; I.S Reed 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 97 KB

For q a power of a prime p, it is known that if m is a power of p or m itself is a prime different from p having q as one of its primitive roots, then the roots of any irreducible polynomial of degree m and of non-zero trace are linearly independent Ž . over GF q . As a consequence the roots of such

Generating orthomorphisms of GF(q)+

✍ Anthony B. Evans 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Equidistant cyclic codes over GF(q)

✍ W.Edwin Clark 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 212 KB

On periodic sequences from GF(q)

✍ Robert J McEliece 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 543 KB

Distributions modulo subgroups of GF(q)

✍ Kjell Kjeldsen 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Unitary Similarity of Normal Matrices in

✍ A. Duane Porter; Leslie Ann Hanson 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB