On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings

DOI10.3934/AMC.2009.3.409zbMATH Open1196.94085arXiv0903.2791OpenAlexW2964269583MaRDI QIDQ2268673FDOQ2268673

Authors: Steve Szabo, Sergio R. López-Permouth 

Publication date: 8 March 2010

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

Abstract: Repeated root Cyclic and Negacyclic codes over Galois rings have been studied much less than their simple root counterparts. This situation is beginning to change. For example, repeated root codes of length $p^s$, where $p$ is the characteristic of the alphabet ring, have been studied under some additional hypotheses. In each one of those cases, the ambient space for the codes has turned out to be a chain ring. In this paper, all remaining cases of cyclic and negacyclic codes of length $p^s$ over a Galois ring alphabet are considered. In these cases the ambient space is a local ring with simple socle but not a chain ring. Nonetheless, by reducing the problem to one dealing with uniserial subambients, a method for computing the Hamming distance of these codes is provided.

Full work available at URL: https://arxiv.org/abs/0903.2791

Recommendations

• Repeated root cyclic and negacyclic codes over Galois rings
• Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
• The distance and weight distribution of cyclic code of length \(2^S\) over \(F_{2^a}\)
• Repeated-root cyclic and negacyclic codes over a finite chain ring
• On some classes of repeated-root constacyclic codes of length a power of 2 over Galois rings

zbMATH Keywords

cyclic codesGalois ringsnegacyclic codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Other types of codes (94B60)

Cited In (9)

• The Hamming distances of negacyclic codes of length \(2^s\) over \(GR (2^a , m )\)
• On a class of repeated-root monomial-like abelian codes
• Some constacyclic codes over finite chain rings
• Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over \(\mathbb{F}_4\)
• A class of constacyclic codes over ring \(R + vr\)
• Repeated root cyclic and negacyclic codes over Galois rings
• p-Adic estimates of hamming weights in abelian codes over galois rings
• On rank and MDR cyclic and negacyclic codes of length \(p^k\) over \(\mathbb Z_{p^m}\)
• On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length

This page was built for publication: On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings

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