|
Problemy Peredachi Informatsii, 2011, Volume 47, Issue 1, Pages 74–91
(Mi ppi2039)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Source Coding
Enumeration of constant-weight run-length limited binary sequences
O. F. Kurmaev Moscow State Institute of Electronic Technology
Abstract:
Constant-weight binary sequences with constrained run lengths of zeros and ones are introduced. These run-length constraints are separate and independent. Using the Babkin–Cover enumerative scheme, the number of these sequences is found. Then enumeration-based encoding and decoding procedures are constructed.
Received: 07.05.2009 Revised: 08.11.2010
Citation:
O. F. Kurmaev, “Enumeration of constant-weight run-length limited binary sequences”, Probl. Peredachi Inf., 47:1 (2011), 74–91; Problems Inform. Transmission, 47:1 (2011), 64–80
Linking options:
https://www.mathnet.ru/eng/ppi2039 https://www.mathnet.ru/eng/ppi/v47/i1/p74
|
Statistics & downloads: |
Abstract page: | 313 | Full-text PDF : | 186 | References: | 50 | First page: | 14 |
|