|
Problemy Peredachi Informatsii, 1978, Volume 14, Issue 1, Pages 26–36
(Mi ppi1519)
|
|
|
|
Information Theory
Variable-Length Convolutional Coding of a Sequence of Independent Binary Symbols
V. N. Koshelev
Abstract:
The article examines the application of convolutional coding methods to the problem of compression of data produced by a binary memoryless source. As compared to a convolutional coding arrangement with a constant compression factor, a variable-compression-factor arrangement has a more reliable and stable sequential decoding procedure. For coding arrangements with a variable generating sequence, bounds are obtained for the first two moments of the number of vertices of a free-type code that can be checked by the decoding device for one message edge.
Received: 01.10.1973 Revised: 10.06.1976
Citation:
V. N. Koshelev, “Variable-Length Convolutional Coding of a Sequence of Independent Binary Symbols”, Probl. Peredachi Inf., 14:1 (1978), 26–36; Problems Inform. Transmission, 14:1 (1978), 17–25
Linking options:
https://www.mathnet.ru/eng/ppi1519 https://www.mathnet.ru/eng/ppi/v14/i1/p26
|
|