|
Problemy Peredachi Informatsii, 2002, Volume 38, Issue 4, Pages 3–9
(Mi ppi1321)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Information Theory and Coding Theory
Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros
O. F. Kurmaev
Abstract:
We suggest a method for computing the number of $dklr$-sequences with given number of ones. Based on these results and the well-known method of Babkin and Cover, enumerative encoding and decoding for constant-weight $dklr$-sequences is obtained.
Received: 18.04.2002
Citation:
O. F. Kurmaev, “Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros”, Probl. Peredachi Inf., 38:4 (2002), 3–9; Problems Inform. Transmission, 38:4 (2002), 249–254
Linking options:
https://www.mathnet.ru/eng/ppi1321 https://www.mathnet.ru/eng/ppi/v38/i4/p3
|
Statistics & downloads: |
Abstract page: | 557 | Full-text PDF : | 278 | References: | 45 |
|