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

Probl. Peredachi Inf., 2002 Volume 38, Issue 3, Pages 3–19 (Mi ppi1312)

Distance Approach to Window Decoding

M. Handlery, R. Johannesson, V. V. Zyablov


Abstract: In convolutional coding, code sequences have infinite length; thus, a maximum-likelihood decoder implies an infinite delay. Due to memory and delay constraints in practical coding schemes, convolutional codes often are either terminated or decoded by a window decoder. When a window decoder is used, the convolutional code sequence is not terminated; instead, the window decoder estimates information digits after receiving a finite number of noise-corrupted code symbols, thereby keeping the decoding delay short. An exact characterization of the error-correcting capability of window decoded convolutional codes is given by using active distances of convolutional codes.

UDC: 621.391.15

Received: 16.10.2001
Revised: 05.03.2002


 English version:
Problems of Information Transmission, 2002, 38:3, 169–181

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025