The minimum Hamming distances of the irreducible cyclic codes of length

DOI10.1080/09720529.2015.1117201zbMath1495.94134OpenAlexW2561036533MaRDI QIDQ5069838

Pankaj, Manju Pruthi

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2015.1117201

zbMATH Keywords

finite fieldcyclic codeirreducible polynomialquotient algebraprimitive idempotent

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Related Items (6)

Cyclic codes with generalized cyclotomic cubic classes ⋮ On cyclic and negacyclic codes of length 8ℓmpn over finite field ⋮ The weight distributions of irreducible cyclic codes of length 2npm ⋮ Primitive idempotents of irreducible cyclic codes of length \(n\) ⋮ Skew cyclic and skew constacyclic codes over the ring 𝔽p + u1𝔽p + ⋯ + u2m𝔽p ⋮ Quantum codes from cyclic codes over the ring Fp[u/〈u3 − u〉]

Cites Work

• Some cyclic codes of length \(2p^n\)
• Constacyclic codes over finite fields
• The minimum Hamming distances of irreducible cyclic 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\).
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The minimum Hamming distances of the irreducible cyclic codes of length