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, 2001, Volume 37, Issue 3, Pages 34–43 (Mi ppi525)  
This article is cited in 4 scientific papers (total in 4 papers)

Source Coding

Coding of Run-Length-Limited Sequences

O. F. Kurmaev
Full-text PDF (933 kB) Citations (4)
References:
PDF
HTML
Abstract: We suggest a method of enumerative block encoding for sequences with constrained length of a run of zeros. Though the algorithm obtained coincides in form with the classical Bahl–Tang method, its application is extended to sequences with a wider class of constraints. We obtain recursion formulas for bit weights.
Received: 23.03.2000
Revised: 13.03.2001
English version:
Problems of Information Transmission, 2001, Volume 37, Issue 3, Pages 216–225
DOI: https://doi.org/10.1023/A:1013826023436
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: O. F. Kurmaev, “Coding of Run-Length-Limited Sequences”, Probl. Peredachi Inf., 37:3 (2001), 34–43; Problems Inform. Transmission, 37:3 (2001), 216–225
Citation in format AMSBIB
\Bibitem{Kur01}
\by O.~F.~Kurmaev
\paper Coding of Run-Length-Limited Sequences
\jour Probl. Peredachi Inf.
\yr 2001
\vol 37
\issue 3
\pages 34--43
\mathnet{http://mi.mathnet.ru/ppi525}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2098983}
\zmath{https://zbmath.org/?q=an:1021.94012}
\transl
\jour Problems Inform. Transmission
\yr 2001
\vol 37
\issue 3
\pages 216--225
\crossref{https://doi.org/10.1023/A:1013826023436}
Linking options:
  • https://www.mathnet.ru/eng/ppi525
  • https://www.mathnet.ru/eng/ppi/v37/i3/p34
    • This publication is cited in the following 4 articles:
    1. O. F. Kurmaev, “Enumeration of constant-weight run-length limited binary sequences”, Problems Inform. Transmission, 47:1 (2011), 64–80  mathnet  crossref  mathscinet  isi
    2. Yu. S. Medvedeva, B. Ya. Ryabko, “Fast enumeration algorithm for words with given constraints on run lengths of ones”, Problems Inform. Transmission, 46:4 (2010), 390–399  mathnet  crossref  mathscinet  isi
    3. Medvedeva Yu., Ryabko B., “Fast Enumeration of Run-Length-Limited Words”, 2009 IEEE International Symposium on Information Theory, 2009, 640–643  crossref  isi
    4. O. F. Kurmaev, “Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros”, Problems Inform. Transmission, 38:4 (2002), 249–254  mathnet  crossref  mathscinet  zmath
    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:361
    Full-text PDF :168
    References:45
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025