Computer Search for Good (n, n-1) Convolutional Codes
碩士 === 國立臺灣大學 === 電信工程學研究所 === 91 === In the paper “On (n, n-1) convolutional codes with low trellis complexity” written by Hung-Hua Tang and Mao-Chao Lin, some good (n, n-1) convolutional codes are found through a new algorithm. However, the search was not complete for all the possible v...
Main Authors: | Hao-Chao Chen, 陳蒿照 |
---|---|
Other Authors: | Mao-Chao Lin |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/92715023550086240026 |
Similar Items
-
Some extended results on the search for good convolutional codes
by: Huang, De Zheng, et al.
Published: (1994) -
On (n, n-2) Convolutional Codes With Minimal Trellis
by: Jin-Ying Hong, et al.
Published: (2009) -
Explore (n,1,ν) Convolutional Codes by 1-Generator Quasi-cyclic Codes
by: Hsiu-HuaTseng, et al.
Published: (2017) -
Asymptotically good convolutional codes with feedback encoders
by: Sallaway, Peter J. (Peter James)
Published: (2008) -
STUDIES ON SEARCH ALGORITHM FOR LOW COMPLEXITY CONVOLUTIONAL CODES
by: Yen-Hwang Wang, et al.
Published: (2006)