DocumentCode :
1253454
Title :
Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
Author :
Ståhl, Per ; Anderson, John B. ; Johannesson, Rolf
Author_Institution :
Dept. of Inf. Technol., Lund Univ., Sweden
Volume :
45
Issue :
7
fYear :
1999
fDate :
11/1/1999 12:00:00 AM
Firstpage :
2562
Lastpage :
2571
Abstract :
The results of an extensive search for short and moderate length polynomial convolutional encoders for time-invariant tail-biting representations of block codes at rates R=1/4, 1/3, 1/2, and 2/3 are reported. The tail-biting representations found are typically as good as the best known block codes
Keywords :
block codes; convolutional codes; polynomials; trellis codes; block codes; moderate-length tail-biting trellises; near-optimal encoders; optimal encoders; polynomial convolutional encoders; short-length tail-biting trellises; time-invariant tail-biting representations; Block codes; Convolutional codes; Costs; Councils; Information technology; Information theory;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.796408
Filename :
796408
Link To Document :
بازگشت