Advertisement

Problems of Information Transmission

, Volume 47, Issue 1, pp 1–14 | Cite as

Woven convolutional graph codes with large free distances

  • I. E. BocharovaEmail author
  • F. Hug
  • R. Johannesson
  • B. D. Kudryashov
Coding Theory

Abstract

Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi decoding of woven graph codes are presented and discussed.

Keywords

Information Transmission Code Rate Block Code Parity Check Convolutional Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bocharova, I.E., Kudryashov, B.D., Johannesson, R., and Zyablov, V.V., Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes, in Proc. 2007 IEEE Int. Sympos. on Information Theory (ISIT’2007), Nice, France, 2007, pp. 2326–2330.Google Scholar
  2. 2.
    Bocharova, I.E., Kudryashov, B.D., Johannesson, R., and Zyablov, V.V., Woven Graph Codes: Asymptotic Performances and Examples, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 1, pp. 121–129.CrossRefMathSciNetGoogle Scholar
  3. 3.
    Berge, C., Graphs and Hypergraphs, Amsterdam: North-Holland, 1976.zbMATHGoogle Scholar
  4. 4.
    Bocharova, I.E., Kudryashov, B.D., and Satyukov, R.V., Graph-Based Convolutional and Block LDPC Codes, Probl. Peredachi Inf., 2009, vol. 45, no. 4, pp. 69–90 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 4, pp. 357–377].MathSciNetGoogle Scholar
  5. 5.
    Tanner, R.M., A Recursive Approach to Low Complexity Codes, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 5, pp. 533–547.CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Johannesson, R. and Zigangirov, K.Sh., Fundamentals of Convolutional Coding, Piscataway: IEEE Press, 1999.CrossRefGoogle Scholar
  7. 7.
    Höst, S., Johannesson, R., and Zyablov, V.V., Woven Convolutional Codes I: Encoder Properties, IEEE Trans. Inform. Theory, 2002, vol. 48, no. 1, pp. 149–161.CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Bocharova, I.E., Handlery, M., Johannesson, R., and Kudryashov, B.D., A BEAST for Prowling in Trees, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 6, pp. 1295–1302.CrossRefMathSciNetGoogle Scholar
  9. 9.
    Hug, F., Bocharova, I.E, Johannesson, R., and Kudryashov, B.D., A Rate R = 5/20 Hypergraph-Based Woven Convolutional Code with Free Distance 120, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 4, pp. 1618–1623.CrossRefMathSciNetGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2011

Authors and Affiliations

  • I. E. Bocharova
    • 1
    Email author
  • F. Hug
    • 2
  • R. Johannesson
    • 2
  • B. D. Kudryashov
    • 1
  1. 1.St. Petersburg State University of Information Technologies, Mechanics and Optics (ITMO)St. PetersburgRussia
  2. 2.Lund UniversityLundSweden

Personalised recommendations