Enumeration and construction of additive cyclic codes over Galois rings

@article{Cao2015EnumerationAC,
  title={Enumeration and construction of additive cyclic codes over Galois rings},
  author={Yonglin Cao and Jian Gao and Fang-Wei Fu and Yuan Cao},
  journal={Discrete Mathematics},
  year={2015},
  volume={338},
  pages={922-937}
}
Let R = GR(p, l) be a Galois ring of characteristic p and cardinality pεl, where p and l are prime integers. First, we give a canonical form decomposition for additive cyclic codes over R. This decomposition is used to construct additive cyclic codes and count the number of such codes, respectively. Thenwe give the trace dual code for each additive cyclic code over R from its canonical form decomposition and linear codes of length l over some extension Galois rings of Zpε . © 2015 Elsevier B.V… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

On the theory of Fq-linar Fqt -codes

  • W. C. Huffman
  • Adv. Math. Commun
  • 2013

Cyclic Fq-linar Fqt -codes

  • W. C. Huffman
  • Int. J. Inf. Coding Theory
  • 2010
2 Excerpts

Additive cyclic codes over F 4 of even length , Adv

  • A. Sălăgean G. Norton
  • Math . Commun .
  • 2008