scientific article; zbMATH DE number 6899198
From MaRDI portal
Publication:4571123
zbMath1390.94891MaRDI QIDQ4571123
Publication date: 6 July 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Cyclic codes (94B15)
Related Items (3)
Cyclotomy and arithmetic properties of some families in Z[x/〈xpq − 1〉] ⋮ Generalized cyclotomic numbers and cyclic codes of prime power length over Z4 ⋮ Cyclotomy, cyclotomic cosets and arithmetic properties of some families in \(\frac{\mathbb{F}_l [x}{\langle x^{p^t q} - 1 \rangle}\)]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some minimal cyclic codes over finite fields
- Cyclotomy and its application to duadic codes
- Some cyclic codes of length \(2p^n\)
- Primitive idempotents and generator polynomials of some minimal cyclic codes of length \({p^n}{q^m}\)
- Idempotents in group algebras and minimal abelian codes
- Minimal codes of prime-power length.
- Minimal cyclic codes of length \(2p^n\)
- Cyclic codes of length \(2^m\)
- Minimal cyclic codes of length \(p^{n} q\).
- The primitive idempotents of a cyclic group algebra.
- Q-codes
- Generalized residue and t-residue codes and their idempotent generators
- Minimal cyclic codes of length \(8p^n\) over \(\mathrm{GF}(q)\), where \(q\) is prime power of the form \(8k+5\)
- Irreducible cyclic codes of length \(4p^n\) and \(8p^n\)
- Minimal quadratic residue cyclic codes of length \(2^n\)
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)]
- The primitive idempotents of a cyclic group algebra. II.
- λ-Mapping and Primitive Idempotents in Semisimple Ring ℜm
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Duadic Codes
- Cyclotomy and duadic codes of prime lengths
- A class of minimal cyclic codes over finite fields
This page was built for publication:
