✦ LIBER ✦

Cyclotomic schemes over finite rings

✍ Scribed by R.W. Goldbach; H.L. Claasen

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 818 KB
Volume: 3
Category: Article
ISSN: 0019-3577
DOI: 10.1016/0019-3577(92)90037-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric association schemes attached t

Symmetric association schemes attached to finite upper half planes over rings

✍ Makoto Tagami 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 195 KB

The finite upper half planes over finite fields and rings are finite analogues of the Poincaré upper half plane. The general linear group G acts transitively on the finite upper half plane. Let K denote the stabilizer of a point. In the case of fields, it is well-known that the pair of (G, K) is a G

Factorization of the Cyclotomic Polynomi

Factorization of the Cyclotomic Polynomialx2n+ 1 over Finite Fields

✍ Helmut Meyn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 152 KB

The aim of this note is to show that the (well-known) factorization of the 2 nϩ1 th cyclotomic polynomial x 2 n ϩ 1 over GF(q) with q ϵ 1 (mod 4) can be used to prove the (more complicated) factorization of this polynomial over GF(q) with q ϵ 3 (mod 4).

Units of Group Rings of Solvable and Fro

Units of Group Rings of Solvable and Frobenius Groups over Large Rings of Cyclotomic Integers

✍ J. Ritter; S.K. Sehgal 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Involutory matrices over finite commutat

Involutory matrices over finite commutative rings

✍ J.V. Brawley; R.O. Gamble 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 829 KB

Parallel polynomial arithmetic over fini

Parallel polynomial arithmetic over finite rings

✍ Robert D. Silverman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 592 KB

Convolution algorithms for polynomial multiplication are well known, as is the use of Residue Number Systems and the Chinese Remainder Theorem. This paper discusses how these techniques may be used to perform polynomial arithmetic over very large rings or finite fields. The algorithm is practical an

A covering problem over finite rings

✍ I.N. Nakaoka; O.J.N.T.N. dos Santos 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Given a finite commutative ring with identity A, define c(A, n, R) as the minimum cardinality of a subset H of A n which satisfies the following property: every element in A n differs in at most R coordinates from a multiple of an element in H. In this work, we determine the numbers c(Z m , n, 0) fo