DocumentCode
2470292
Title
Interleaving does not always achieve the largest minimum burst distance asymptotically
Author
Hamada, Mitsuru
Author_Institution
Graduate Sch. of Inf. Syst., Univ. of Electro-Commun., Chofu, Japan
fYear
1998
fDate
16-21 Aug 1998
Firstpage
247
Abstract
It is shown that the most typical interleaving scheme fails to achieve the largest relative minimum burst distance of codes asymptotically for uncountably many values of the information rate
Keywords
block codes; error correction codes; interleaved codes; asymptotic largest minimum burst distance; codes; information rate; interleaving; Block codes; Hamming distance; Information rates; Information systems; Interleaved codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708852
Filename
708852
Link To Document