Skip to main content
SpringerLink
Log in

Soft decoding for block codes obtained from convolutional codes

  • Conference paper
  • First Online:
Algebraic Coding (Algebraic Coding 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 573))

Included in the following conference series:

Abstract

Bounds for the minimum distance and the error probability of decoding for tail biting convolutional codes are presented. We propose a decoding algorithm for these codes and obtain a bound for the asymptotical complexity of almost maximum likelihood decoding.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.Ma, J.K.Wolf. On the tail biting convolutional codes. IEEE Trans. Commun., 1986, v.34, 2, p.104–111.

    Article  Google Scholar 

  2. G.D.Forney. Convolutional codes, 2: Maximum likelihood decoding. Information and Control, 1974, v.25, 3, p. 222–266.

    Article  Google Scholar 

  3. K.Sh.Zigangirov, V.D.Kolesnik. Centered codes. Probl. Pered. Inf., 1984, v.20, 2, p.3–17.

    Google Scholar 

  4. G.S.Evseev. On the complexity of decoding linear codes. Probl. Pered. Inf., 1983, v. 19, 1, p.3–8.

    Google Scholar 

  5. A.M.Barg, I.I.Dumer. An algorithm of concatenative decoding with incomplete code vectors look through. Probl. Pered. Inf., 1986, v.22, 1, p.3–10.

    Google Scholar 

  6. Krouck E.A. A bound on the decoding complexity of linear block codes. Probl. Pered. Inf., 1989, v.25, 3, p. 103–106.

    Google Scholar 

  7. J.K.Wolf. Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Trans. Inform. Theory, 1978, v.24, 1, p.76–80.

    Article  Google Scholar 

  8. I.I.Dumer. On complexity of maximum likelihood decoding for the best concatenated codes. 8-th conf. on coding and inf. theory, Moscow-Kuybyshev, 1981, 2, p.66–69.

    Google Scholar 

  9. Kudryashov B.D., Zakharova T.G. Block codes from convolutional codes. Probl. Pered. Inf., 1989, v.25, 4, p.98–102.

    Google Scholar 

  10. Kudryashov B.D. Decoding of block codes obtained from convolutional codes. Probl.Pered. Inf., 1990, v.26, 3, p.18–26.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leningrad Aircraft Equipment Institute, Hertsen str. 67, 190000, Leningrad, USSR

    Boris D. Kudryashov

Authors
  1. Boris D. Kudryashov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Antoine Lobstein Gilles Zémor Simon Litsyn

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kudryashov, B.D. (1992). Soft decoding for block codes obtained from convolutional codes. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034347

Download citation

  • DOI: https://doi.org/10.1007/BFb0034347

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55130-0

  • Online ISBN: 978-3-540-46739-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation