Minimal cyclic codes of length \(2p^n\)

DOI10.1006/ffta.1998.0238zbMath1098.94639OpenAlexW2073066000MaRDI QIDQ1290928

Manju Pruthi, Suresh Kumar Arora

Publication date: 9 June 2003

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1998.0238

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40)

Related Items (34)

Cyclic codes with generalized cyclotomic cubic classes ⋮ Cyclic codes of length \(2^m\) ⋮ EXPLICIT DETERMINATION OF CERTAIN MINIMAL ABELIAN CODES AND THEIR MINIMUM DISTANCES ⋮ The minimum Hamming distances of the irreducible cyclic codes of length ⋮ Group algebras and coding theory ⋮ Weight distributions of cyclic codes of length \(t l^m\) ⋮ Cyclic codes of length \(2p^n\) over finite chain rings ⋮ The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes ⋮ Some minimal cyclic codes over finite fields ⋮ Burst error-correcting quantum stabilizer codes designed from idempotents ⋮ Explicit idempotents of finite group algebras. ⋮ Some cyclic codes of length \(2p^n\) ⋮ Minimal cyclic codes of length \(p^{n} q\). ⋮ A class of minimal cyclic codes over finite fields ⋮ Primitive idempotents of irreducible cyclic codes of length \(n\) ⋮ Repeated-root constacyclic codes of length ⋮ Primitive idempotents in group algebras and minimal abelian codes ⋮ The primitive idempotents and weight distributions of irreducible constacyclic codes ⋮ Idempotents in group algebras and minimal abelian codes ⋮ Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings ⋮ A class of minimal cyclic codes over finite fields ⋮ Minimal cyclic codes of length \(p^nq\) ⋮ Primitive idempotents of cyclic codes of length \(p\) and 2\(p\) ⋮ Unnamed Item ⋮ The weight distributions of some irreducible cyclic codes of length \(p^n\) and \(2p^n\) ⋮ The minimum Hamming distances of irreducible cyclic codes ⋮ Minimum distance and idempotent generators of minimal cyclic codes of length ${p_1}^{\alpha_1}{p_2}^{\alpha_2}{p_3}^{\alpha_3}$ ⋮ Unnamed Item ⋮ New \(\ast\)-clean finite group rings under the conjugate involution ⋮ Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)] ⋮ λ-Mapping and Primitive Idempotents in Semisimple Ring ℜ_m ⋮ 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\)

Cites Work

• Minimal codes of prime-power length.
• Semisimple cyclic and Abelian codes. II
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal cyclic codes of length \(2p^n\)