✦ LIBER ✦

Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics

✍ Scribed by Melsik K. Kyuregyan

Book ID: 108485813
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 201 KB
Volume: 9
Category: Article
ISSN: 1071-5797
DOI: 10.1016/s1071-5797(02)00005-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recurrent Methods for Constructing Irred

Recurrent Methods for Constructing Irreducible Polynomials over GF(2s)

✍ Mels K. Kyuregyan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 283 KB

The paper is devoted to some results concerning the constructive theory of the synthesis of irreducible polynomials over Galois "elds GF(q), q"2Q. New methods for the construction of irreducible polynomials of higher degree over GF(q) from a given one are worked out. The complexity of calculations d

An enumeration formula for certain irred

An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field

✍ Harald Niederreiter 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 268 KB

Method for construction of characteristi

Method for construction of characteristic polynomials via graph linearization

✍ Kakali Datta; Asok K. Mukherjee 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

A new method for construction of characteristic polynomials CP of complicated graphs having arbitrary edge and vertex weights has been developed. The method first converts the graph into isospectral linear chains with weighted vertices and edges and then builds up the CP coefficients recursively. Tw