DocumentCode :
912367
Title :
A strengthened asymptotic Gilbert bound for convolutional codes (Corresp.)
Author :
Bower, E.
Volume :
15
Issue :
3
fYear :
1969
fDate :
5/1/1969 12:00:00 AM
Firstpage :
433
Lastpage :
435
Abstract :
The usual statement of the Gilbert bound is an assertion that at least one member of a given ensemble of codes satisfies a minimum distance criterion. This result is strengthened by showing that for sufficiently large constraint lengths, an arbitrarily large fraction of the ensemble of codes have minimum distance exceeding the usual asymptotic Gilbert bound. New asymptotic bounds are derived for the nonbinary case.
Keywords :
Convolutional codes; Block codes; Convolutional codes; Delay; Polynomials;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1969.1054311
Filename :
1054311
Link To Document :
بازگشت