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

Probl. Peredachi Inf., 1966 Volume 2, Issue 2, Pages 12–28 (Mi ppi1930)

Estimate of the Complexity of Sequential Decoding of Random Tree Codes

V. N. Koshelev


Abstract: An algorithm of a modification of sequential decoding is described, and estimates are obtained characterizing the complexity and reliability of the method.

UDC: 621.391.156

Received: 01.10.1965


 English version:
Problems of Information Transmission, 1966, 2:2, 8–20

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024