Advertisement

Decoding Complexity and Concatenated Codes

  • V. V. Ziablov
Part of the International Centre for Mechanical Sciences book series (CISM, volume 216)

Abstract

Let Ψ:X→Y be some Boolean function, where X and Y are sets of binary words of length n1 and n2, respectively. It is obvious that encoding and decoding can be viewed as such a Boolean function.

Keywords

Boolean Function Clock Cycle Level Code Information Symbol Decode Complexity 
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]
    Dobrushin, A.L., Gelfand, S.I., Pinsker, M.S., Asymptotically Optimal Coding by Simple Schemes. The Second International Symposium on Information Theory. Abstracts of Papers.Tsahkadsor, 1971, pp. 44–46.Google Scholar
  2. [2]
    Ziablov, V.V., Decoding Complexity of Iterative and Concatenated Codes. The Second International Symposium on Information Theory. Abstracts of Papers. Tsahkadsor, 1971, pp. 83–87.Google Scholar
  3. [3]
    Ziablov, V.V., Pinsker,M.S., Correcting Capability and Decoding Complexity of Codes with a Small Number of Ones in the Parity-Check Matrices. The Second International Symposium on Information Theory. Abstracts of Papers. Tsahkadsor, 1971, pp. 88–91.Google Scholar
  4. [4]
    Bloh, E.L., Ziablov, V.V., Encoding and Decoding of Generalized Concatenated Codes. The Third International Symposium on Information Theory. Abstracts of Papers, part II. Tallinn, 1973, pp. 36–40.Google Scholar
  5. [5]
    Ziablov, V.V., Pinsker, M.S., Decoding Complexity for Low-Density Parity-Check Codes Used for Transmission over a Channel with Erasures. Problemy Peredachi Informatsii N. 1. 1974.Google Scholar

Copyright information

© Springer-Verlag Wien 1975

Authors and Affiliations

  • V. V. Ziablov

There are no affiliations available

Personalised recommendations