作者: G. Solomon , H. C. A. Tilborg
DOI: 10.1137/0137027
关键词:
摘要: Convolutional codes of any rate and constraint length give rise to a sequence quasi-cyclic codes. Conversely, code may be convolutionally encoded. Among the are quadratic residue codes, Reed–Solomon optimal BCH The K for convolutional encoding many these (Golay, (48, 24) OR, etc.) turns out surprisingly small. Thus using soft decoding techniques we now have new maximum likelihood algorithm block Conversely an will yield with local properties therefore good infinite coding properties.