On Good Convolutional Codes with Optimal Free Distance for Rates 1/2, 1/3 and 1/4

Naoto SONE  Masami MOHRI  Masakatu MORII  Hiroshi SASANO  

Publication
IEICE TRANSACTIONS on Communications   Vol.E84-B   No.1   pp.116-119
Publication Date: 2001/01/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories
Keyword: 
convolutional code,  optimum free distance (OFD),  minimum free distance,  Cedervall-Johannesson algorithm,  

Full Text: PDF(120.3KB)>>
Buy this Article




Summary: 
New good convolutional codes with optimal free distance are tabulated for the number of memories M 22 and rate R=1/2, which were selected based on the criterion of minimizing the decoding error rate and bit error rate. Furthermore, for R=1/3, 1/4 and M 13, we give the new good codes and make clear the existance of the codes with minimum free distance which achieve to Heller's upper bound for M 16.