On efficiency of prefix word-encoding of binary messages

  • E. G. Vorobyova
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


Continuous Function Computational Complexity Computer System Mathematical Logic Problem 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.


  1. 1.
    Goppa V.D. Information of words (first approximation — information without memory). — Probl.InformTrans.,14 (1978),No.3,p.3–17.Google Scholar
  2. 2.
    Babkin V.F. A method of universal coding with non-exponent labour consumption. — Probl.InformTrans.,7(1971),No.4,p.13–21.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • E. G. Vorobyova
    • 1
  1. 1.Gorky State UniversityGorkyUSSR

Personalised recommendations