✦ LIBER ✦

Generation of irreducible polynomials from trinomials over GF(2). I

✍ Scribed by B.G. Bajoga; W.J. Walbesser

Book ID: 114037232
Publisher: Elsevier Science
Year: 1976
Weight: 376 KB
Volume: 30
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(76)90360-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generation of irreducible polynomials fr

Generation of irreducible polynomials from trinomials over GF(2). II

✍ B.G. Bajoga 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 450 KB

Irreducible Polynomials Which Divide Tri

Irreducible Polynomials Which Divide Trinomials Over GF (2)

✍ Solomon W. Golomb; Pey-Feng Lee 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 278 KB

Fast Algorithms to Generate Necklaces, U

Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)

✍ Kevin Cattell; Frank Ruskey; Joe Sawada; Micaela Serra; C.Robert Miers 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Many applications call for exhaustive lists of strings subject to various constraints, such as inequivalence under group actions. A k-ary necklace is an Ž . equivalence class of k-ary strings under rotation the cyclic group . A k-ary unlabeled necklace is an equivalence class of k-ary strings under

An improvement of Rabin's probabilistic

An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)

✍ Jacques Calmet; Rüdiger Loos 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Generating Lyndon brackets.: An addendum

Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2)

✍ J. Sawada; F. Ruskey 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 62 KB

Generation of m-sequences over GF(q2) fr

Generation of m-sequences over GF(q2) from m-sequences over GF(q)

✍ John J. Komo; Maurice S. Lam 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB