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, 1966, Volume 2, Issue 2, Pages 3–11 (Mi ppi1929)  
This article is cited in 9 scientific papers (total in 9 papers)

Optimal Coding in the Case of Unknown and Changing Message Statistics

B. M. Fitingof
Full-text PDF (1266 kB) Citations (9)
Abstract: A coding method is proposed which is independent of the message probabilities and permits a compression of the messages corresponding to their redundancy, without a knowledge of the statistical laws responsible for this redundancy. Sufficient conditions are formulated for optimality of coding in this sense. It is pointed out how results of this kind may be generalized to a noisy channel, in the sense of obtaining optimal methods of transmitting over such channel messages which are independent of the statistics of the message source.
Received: 09.11.1964
Bibliographic databases:
UDC: 621.391.15:519
Language: Russian
Citation: B. M. Fitingof, “Optimal Coding in the Case of Unknown and Changing Message Statistics”, Probl. Peredachi Inf., 2:2 (1966), 3–11; Problems Inform. Transmission, 2:2 (1966), 1–7
Citation in format AMSBIB
\Bibitem{Fit66}
\by B.~M.~Fitingof
\paper Optimal Coding in the Case of Unknown and Changing Message Statistics
\jour Probl. Peredachi Inf.
\yr 1966
\vol 2
\issue 2
\pages 3--11
\mathnet{http://mi.mathnet.ru/ppi1929}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=202498}
\zmath{https://zbmath.org/?q=an:0295.94041}
\transl
\jour Problems Inform. Transmission
\yr 1966
\vol 2
\issue 2
\pages 1--7
Linking options:
  • https://www.mathnet.ru/eng/ppi1929
  • https://www.mathnet.ru/eng/ppi/v2/i2/p3
    • This publication is cited in the following 9 articles:
    1. Trofimov V.K., Khramova V T., “Coding of Moore and Mealy Sources By Nonequivalent Symbols At Unknown Message Statistics”, Optoelectron. Instrum. Data Proc., 57:2 (2021), 167–176  crossref  isi  scopus
    2. B. D. Kudryashov, A. V. Porov, “Universal coding for memoryless sources with countably infinite alphabets”, Problems Inform. Transmission, 50:4 (2014), 390–399  mathnet  crossref  isi  elib
    3. V. K. Trofimov, T. V. Khramova, “Universalnoe kodirovanie markovskikh istochnikov neravnoznachnymi simvolami”, Diskretn. analiz i issled. oper., 20:3 (2013), 71–83  mathnet  mathscinet
    4. Trofimov V.K., Khramova T.V., “Szhatie neravnoznachnymi simvolami informatsii, porozhdennoi neizvestnym istochnikom bez pamyati”, Avtometriya, 48:1 (2012), 30–44 Compression of information generated by an unknown memoryless source by nonequivalent symbols  elib
    5. V. V. V'yugin, “Problems of Robustness for Universal Coding Schemes”, Problems Inform. Transmission, 39:1 (2003), 32–46  mathnet  crossref  mathscinet  zmath
    6. V. P. Maslov, “Remark on a Computer-Oriented Language”, Problems Inform. Transmission, 39:3 (2003), 294–298  mathnet  crossref  zmath
    7. V. V. V'yugin, V. P. Maslov, “On Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity”, Problems Inform. Transmission, 39:4 (2003), 380–394  mathnet  crossref  mathscinet  zmath
    8. Verdu, S, “Fifty years of Shannon Theory”, IEEE Transactions on Information Theory, 44:6 (1998), 2057  crossref  isi
    9. V. D. Goppa, “Codes and information”, Russian Math. Surveys, 39:1 (1984), 87–141  mathnet  crossref  mathscinet  zmath  adsnasa  isi
    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:959
    Full-text PDF :438
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025