Skip to main content
SpringerLink
Log in

Construction of repeated-root constacyclic code of length 8 p s over \(F_{p^m } \)

  • Mathematics
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

For any odd prime p, a classification of all cyclic and negacyclic codes of length 8 p s over \(F_{p^m } \) are obtained, which establishes the algebra structures in term of specified polynomial generators of such codes. Among other results, all self-dual negacyclic codes of length 8 p s are obtained, and the structures of α-constacyclic and β-constacyclic codes of length 8 p s over \(F_{p^m } \) are established.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berman S D. Semisimple cyclic and Abelian codes, II[J]. Cybernetics, 1967, 3:17–23.

    Article  Google Scholar 

  2. Castagnoli G, Massey J L, Schoeller P A, et al. On repeated-cyclic codes[J]. IEEE Trans Inform Theory, 1991, 37: 337–342.

    Article  Google Scholar 

  3. Van Lint J H. Repeated-root cyclic codes[J]. IEEE Trans Inform Theory, 1991, 37: 343–345.

    Article  Google Scholar 

  4. Bakshi G K, Raka M. A class of constacyclic codes over a finite field[J]. Finite Field Appl, 2012, 18(2): 362–377.

    Article  Google Scholar 

  5. Bakshi G K, Raka M. Self-dual and self-orthogonal negacyclic codes of length over a finite field[J]. Finite Field Appl, 2013, 19: 39–54.

    Article  Google Scholar 

  6. Dinh H Q. Complete distances of all negacyclic codes of length 2s over \(Z_{2^a } \) [J]. IEEE Trans Inform Theory, 2007, 53: 147–161.

    Article  Google Scholar 

  7. Dinh H Q. Negacyclic codes of length 2S over Galois rings[J]. IEEE Trans Inform Theory, 2005, 1(12): 4252–4262.

    Article  Google Scholar 

  8. Dinh H Q. On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions[J]. Finite Field Appl, 2008, 14: 22–24.

    Article  Google Scholar 

  9. Dinh H Q. Repeated-root constacyclic codes of length 2ps[J]. Finite Field Appl, 2012, 18: 133–143.

    Article  Google Scholar 

  10. Dinh H Q. Structure of repeated-rootconstacyclic codes of lengthand their duals[J]. Discrete Math, 2013, 313: 983–991.

    Article  Google Scholar 

  11. Huffman W C, Pless V. Fundamentals of Error-Correcting Codes[M]. Cambridge: Cambridge University Press, 2003.

    Google Scholar 

  12. Chen B, Fan Y, Liu L, et al. Constacyclic codes over finite fields[J]. Finite Field Appl, 2012, 18: 1217–1231.

    Article  CAS  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Physics, Hubei Polytechnic University, Huangshi, 435003, Hubei, China

    Xiaoyan Zhang & Qili Mao

Authors
  1. Xiaoyan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qili Mao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoyan Zhang.

Additional information

Foundation item: Supported by the Natural Science Foundation of Hubei Province (D20144401) and the Natural Science Foundation of Hubei Polytechnic University (12xjz14A)

Biography: ZHANG Xiaoyan, female, Associate professor, research direction: algebra coding.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, X., Mao, Q. Construction of repeated-root constacyclic code of length 8 p s over \(F_{p^m } \) . Wuhan Univ. J. Nat. Sci. 20, 1–7 (2015). https://doi.org/10.1007/s11859-015-1051-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-015-1051-7

Key words

CLC number

Search

Navigation