Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 1982, Volume 18, Issue 2, Pages 3–11 (Mi ppi1221)  
Information Theory and Coding Theory

Methods of Constructing Lower Bounds for Redundancy of Universal Coding

Yu. M. Shtar'kov
Full-text PDF (943 kB)
Abstract: The article proposes a new approach to the construction of lower bounds for the redundancy of universal coding. A relationship to the problem of choosing reliably discriminable hypotheses is established, and some examples are considered.
Received: 16.01.1981
Revised: 14.12.1981
Bibliographic databases:
Document Type: Article
UDC: 621.391.15:519.28
Language: Russian
Citation: Yu. M. Shtar'kov, “Methods of Constructing Lower Bounds for Redundancy of Universal Coding”, Probl. Peredachi Inf., 18:2 (1982), 3–11; Problems Inform. Transmission, 18:2 (1982), 85–92
Citation in format AMSBIB
\Bibitem{Sht82}
\by Yu.~M.~Shtar'kov
\paper Methods of Constructing Lower Bounds for Redundancy of Universal Coding
\jour Probl. Peredachi Inf.
\yr 1982
\vol 18
\issue 2
\pages 3--11
\mathnet{http://mi.mathnet.ru/ppi1221}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=689336}
\zmath{https://zbmath.org/?q=an:0499.94011}
\transl
\jour Problems Inform. Transmission
\yr 1982
\vol 18
\issue 2
\pages 85--92
Linking options:
  • https://www.mathnet.ru/eng/ppi1221
  • https://www.mathnet.ru/eng/ppi/v18/i2/p3
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:181
    Full-text PDF :92
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024