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

Probl. Peredachi Inf., 1984 Volume 20, Issue 1, Pages 105–109 (Mi ppi1126)

Ņorrespondence

Comparision of Decoding Comlexity for Truncated Convolutional Codes and Block Codes

V. V. Zyablov, S. A. Shavgulidze


Abstract: We compare the complexity of maximum likelihood decoding of truncated convolutional codes with that of best known block codes.

UDC: 621.391.15:519.72

Received: 19.04.1982



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025