Skip to main content
Log in

The generalization of some trellis properties of linear codes to group codes

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

In this paper, we discuss some trellis properties for codes over a finite Abelian group, which are the generalization of the corresponding trellis properties for linear codes over a field. Also, we also investigate difficulties when we try to generalize a property of a tail-biting trellis for a linear code over a field to a group code.

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. Vardy A. Trellis structure of codes. Handbook of Coding Theory. Pless V S, Huffman W C, eds. Amsterdam: Elsevier, 1998. 1989–2118

    Google Scholar 

  2. Kschischang F R, Sorokine V. On the trellis structure of block codes. IEEE Trans Inform Theory, 1995, 41: 1924–1937

    Article  MATH  MathSciNet  Google Scholar 

  3. Forney G D Jr. Dimension/length profiles and trellis complexity of linear block codes. IEEE Trans Inform Theory, 1994, 40(6): 1741–1752

    Article  MATH  MathSciNet  Google Scholar 

  4. Vazirani V, Saran H, Rajan B. An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups. IEEE Trans Inform Theory, 1996, 42: 1839–1854

    Article  MATH  MathSciNet  Google Scholar 

  5. Koetter R, Vardy A. On the theory of linear trellises. Information, Coding and Mathematics. Blaum M, ed. Boston: Kluwer, 2002. 323–354

    Google Scholar 

  6. Koetter R, Vardy A. The structure of tail-biting trellises: minimality and basic principals. IEEE Trans Inform Theory, 2003, 49: 2081–2105

    Article  MathSciNet  Google Scholar 

  7. Calderbank A R, Forney G D Jr, Vardy A. Minimal tail-biting trellises: the Golay code and more. IEEE Trans Inform Theory, 1999, 45: 1435–1455

    Article  MATH  MathSciNet  Google Scholar 

  8. Kan H B, Hong S. A note on Tanner graph for group block codes and lattices. IEICE Trans Fundamentals, 2004, E87-A(8): 2182–2184

    Google Scholar 

  9. Kan H B, Hong S. Trellis properties of product codes. IEICE Trans Fundamentals, 2005, E88-A(1): 353–358

    Article  Google Scholar 

  10. Kan H B, Hong S. A relation between the characteristic generators of a linear code and its dual. IEEE Trans Inform Theory, 2005, 51(3): 1199–1202

    Article  MathSciNet  Google Scholar 

  11. Kan H B, Hong S. Trellis properties of group codes. In: the 6th International Conference Advanced Communication Technology. 2005, 1: 203–206

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to HaiBin Kan.

Additional information

Supported by the National Natural Science Foundation of China (No. 60772131), Shanghai Pujian Talent Program (No. 06PJ14009), Fox Ying Yung Education Foundation (No. 114401) and NCET’08. The material in this paper was presented in part at the 6th International Conference Advanced Communication Technology, Korea, 2005

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kan, H., Li, X. & Shen, H. The generalization of some trellis properties of linear codes to group codes. Sci. China Ser. F-Inf. Sci. 52, 797–803 (2009). https://doi.org/10.1007/s11432-009-0096-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-009-0096-7

Keywords

Navigation