On Good convolutional Codes with Optimal Free Distance for Rates 1/2, 1/3 and 1/4
スポンサーリンク
概要
- 論文の詳細を見る
New good convolutional codes with optimal free distance are tabulated for the unmber 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. Fuithermore, 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.
- 社団法人電子情報通信学会の論文
- 2001-01-01
著者
-
Sasano Hiroshi
The Author Is With The Faculty Of Science And Engineering Kinki University
-
MORII Masakatu
The authors are with the Department of Information Science and Intelligent Systems, Faculty of Engin
-
SONE Naoto
The author is with the Information Processing Center, Naruto University of Education
-
MOHRI Masami
The authors are with the Department of Information Science and Intelligent Systems, Faculty of Engin
-
Sone Naoto
The Author Is With The Information Processing Center Naruto University Of Education
-
Sasano H
The Author Is With The Faculty Of Science And Engineering Kinki University
-
Mohri Masami
The Authors Are With The Department Of Information Science And Intelligent Systems Faculty Of Engine
-
Sone N
The author is with the Information Processing Center, Naruto University of Education
-
Mohri M
The authors are with the Department of Information Science and Intelligent Systems, Faculty of Engineering, The University of Tokushima
-
Morii M
The authors are with the Department of Information Science and Intelligent Systems, Faculty of Engineering, The University of Tokushima
関連論文
- A Simple Parallel Algorithm for the Ziv-Lempel Encoding
- On Good convolutional Codes with Optimal Free Distance for Rates 1/2, 1/3 and 1/4