Skip to main content
Log in

A note on characteristic generators of a free cyclic code and its dual

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Let C be a free cyclic code over Z n α and dim p C = k. In the paper, we prove that if the k characteristic generators of C are p-linearly independent then the corresponding k characteristic generators of C are p-linearly independent. We then show that to any trellis that can be constructed from k p-linearly independent characteristic generators of C, there exists a trellis for C with the same state-complexity profile, which generalizes the conjecture of Koetter and Vardy to a free cyclic code over Z n α.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Hammons A R, Kumar P V, Calderbank A R, et al. The Z 4-Linearity of Kerdock, Preparata, and Goethals and Related Codes[J]. IEEE Trans Inf Theory, 1994, 40: 301–319.

    Article  MATH  MathSciNet  Google Scholar 

  2. Wolf J. Efficient Maximum Likelihood Decoding of Linear Block Codes Using a Trellis[J]. IEEE Trans Inf Theory, 1978, IT-24: 76–80.

    Article  Google Scholar 

  3. Forney G D. The Viterbi Algorithm[J]. Proc IEEE, 1973, 61: 268–276.

    Article  MathSciNet  Google Scholar 

  4. Kschischang F R. The Trellis Structure of Maximal Fixed-Cost Codes[J]. IEEE Trans Inf Theory, 1996, 42: 1828–1838.

    Article  MATH  MathSciNet  Google Scholar 

  5. Vazirani V, Saran H, Rajan B. An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups[J]. IEEE Trans Inf Theory, 1996, 42: 1839–1854.

    Article  MATH  MathSciNet  Google Scholar 

  6. Koetter R, Vardy A. The Structure of Tail-Biting Trellises: Minimality and Basic Principals[J]. IEEE Trans Inf Theory, 2003, 49: 2081–2105.

    Article  MathSciNet  Google Scholar 

  7. Kan H, Shen H. A Relation between the Characteristic Generators of a Linear Code and Its Dual[J]. IEEE Trans Inf Theory, 2005, 51: 1199–1202.

    Article  MathSciNet  Google Scholar 

  8. Norton G H, Sǎlǎgean A. On the Structure of Linear and Cyclic Codes over a Finite Chain Rings[J]. Appl Algebra Eng Comm Comput, 2000, 10: 489–506.

    Article  MATH  Google Scholar 

  9. Calerbank A R, Sloane N J A. Modular and p-Adic Cyclic Codes[J]. Designs Codes Cryptogr, 1995, 6: 21–35.

    Article  Google Scholar 

  10. Kan H, Li X, Shen H. The Characteristic Generators for a Group Code[J]. IEICE Tran Fundamentals, 2006, E89-A(5): 1513–1517.

    Article  Google Scholar 

  11. Norton G H, Sǎlǎgean A. On the Hamming Distance of Linear Codes over a Finite Chain Rings[J]. IEEE Trans Inf Theory, 2000, 46(3): 1060–1067.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhongping Qin.

Additional information

Foundation item: Supported by the National Natural Science Foundation of China(60673071)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, Q., Qin, Z. A note on characteristic generators of a free cyclic code and its dual. Wuhan Univ. J. Nat. Sci. 14, 14–18 (2009). https://doi.org/10.1007/s11859-009-0104-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-009-0104-1

Key words

CLC number

Navigation