Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\)
From MaRDI portal
Publication:2566960
DOI10.1016/j.ffa.2004.01.005zbMath1075.11081MaRDI QIDQ2566960
V. C. Dumir, Madhu Raka, Anuradha Sharma, Gurmeet K. Bakshi
Publication date: 29 September 2005
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2004.01.005
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B15: Cyclic codes
11T55: Arithmetic theory of polynomial rings over finite fields
13M05: Structure of finite commutative rings
Related Items
Unnamed Item, Unnamed Item, Cyclotomic cosets and primitive idempotents in semisimple ring, Cyclotomy and arithmetic properties of some families in Z[x/〈xpq − 1〉], On idempotents of a class of commutative rings, Generalized cyclotomic numbers and cyclic codes of prime power length over Z4, A class of minimal cyclic codes over finite fields, A class of minimal cyclic codes over finite fields, Weight enumerators of all cubic-primitive irreducible cyclic codes of odd prime power length, Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes, Some minimal cyclic codes over finite fields, Explicit idempotents of finite group algebras., Repeated-root constacyclic codes of length \(\ell p^s\) and their duals, The weight distribution of some irreducible cyclic codes, Explicit determination of certain minimal constabelian codes, A class of constacyclic codes over a finite field, On cyclotomic cosets and code constructions, Minimal cyclic codes of length \(p^{n} q\)., Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field, Primitive idempotents of cyclic codes of length \(p\) and 2\(p\), Semisimple metacyclic group algebras., Semisimple finite group algebra of a generalized strongly monomial group, Repeated-root constacyclic codes of length \(2 \ell^m p^n\), Repeated-root constacyclic codes of length \(6lp^s\), Repeated-root constacyclic codes of length \(3 \ell^m p^s\), Repeated-root constacyclic codes of length \(k\ell p^s\), Repeated-root constacyclic codes of length \(n l p^s\), Group algebras and coding theory, Galois self-dual constacyclic codes, Primitive idempotent tables of cyclic and constacyclic codes, Cyclotomic problem, Gauss sums and Legendre curve, Polyadic codes of prime power length, Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)], Concatenated structure of left dihedral codes, λ-Mapping and Primitive Idempotents in Semisimple Ring ℜm, EXPLICIT DETERMINATION OF CERTAIN MINIMAL ABELIAN CODES AND THEIR MINIMUM DISTANCES, Minimum distance and idempotent generators of minimal cyclic codes of length ${p_1}^{\alpha_1}{p_2}^{\alpha_2}{p_3}^{\alpha_3}$
Cites Work
- Minimal codes of prime-power length.
- Minimal cyclic codes of length \(2p^n\)
- Minimal cyclic codes of length \(p^{n} q\).
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)]
- Jacobi sums over finite fields
- Complete solution of the cyclotomic problem in $F_q$ for any prime modulus $l, q = p^α, p ≡ 1 (mod l)$
- Resolution of the sign ambiguity in the determination of the cyclotomic numbers of order 4 and the corresponding Jacobsthal sum.
- Semisimple cyclic and Abelian codes. II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
