A note on negacyclic and cyclic codes of length p^s over a finite field of characteristic p

DOI10.3934/AMC.2009.3.265MaRDI QIDQ2268255zbMATH OpenOpenAlexFDO

Authors Hakan Özadam, Ferruh Özbudak

Publication date 10 March 2010

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2009.3.265

zbMATH Keywords

cyclic coderepeated-root cyclic codenegacyclic code

Mathematics Subject Classification ID

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

Recommendations

• The minimum Hamming distance of cyclic codes of length \(2p^s\)
• On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
• Cyclic and negacyclic codes of length \(2p^s\) over \(\mathbb F_{p^m}+u\mathbb F_{p^m}\)
• Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their duals
• Cyclic codes of length \(2p^n\) over finite chain rings

Cited in

(6)

• On a class of repeated-root monomial-like abelian codes
• On cyclic and negacyclic codes of length 8ℓmpn over finite field
• On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
• A characterization of optimal constacyclic locally repairable codes
• Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields
• The minimum Hamming distance of cyclic codes of length \(2p^s\)

This page was built for publication: A note on negacyclic and cyclic codes of length \(p^s\) over a finite field of characteristic \(p\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268255)