Negacyclic codes of length 2/sup s/ over galois rings

@article{Dinh2005NegacyclicCO,
  title={Negacyclic codes of length 2/sup s/ over galois rings},
  author={Hai Quang Dinh},
  journal={IEEE Transactions on Information Theory},
  year={2005},
  volume={51},
  pages={4252-4262}
}
Codes over the ring of integers modulo 4 have been studied by many researchers. Negacyclic codes such that the length n of the code is odd have been characterized over the alphabet Zopf<sub>4</sub>, and furthermore, have been generalized to the case of the alphabet being a finite commutative chain ring. In this paper, we investigate negacyclic codes of length 2<sup>s</sup> over Galois rings. The structure of negacyclic codes of length 2<sup>s</sup> over the Galois rings GR(2<sup>a</sup>,m), as… CONTINUE READING

Tables and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 33 CITATIONS

The Hamming Distances of Negacyclic Codes of Length 2s over GR(2a,m)

  • J. Systems Science & Complexity
  • 2008
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$

  • IEEE Transactions on Information Theory
  • 2007
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS

Some Repeated-Root Constacyclic Codes Over Galois Rings

  • IEEE Transactions on Information Theory
  • 2017
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES