|
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
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
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
Linking options:
https://www.mathnet.ru/eng/ppi525 https://www.mathnet.ru/eng/ppi/v37/i3/p34
|
Statistics & downloads: |
Abstract page: | 334 | Full-text PDF : | 142 | References: | 32 | First page: | 1 |
|