RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2001 Volume 37, Issue 3, Pages 34–43 (Mi ppi525)

This article is cited 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.

UDC: 621.391.15

Received: 23.03.2000
Revised: 13.03.2001


 English version:
Problems of Information Transmission, 2001, 37:3, 216–225

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024