DocumentCode
3054863
Title
Good universal codes can be obtained by concatenated codes
Author
Uyematsu, Tomohiko
Author_Institution
Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
346
Abstract
This paper investigates the error correcting capabilities of concatenated codes with time-varying randomly selected constant composition inner codes. It is proved that such code can achieve Gallager´s (1968) random coding error exponent for all rates, while both encoding and decoding of the codes do not depend on the channel
Keywords
channel capacity; coding errors; concatenated codes; discrete time systems; error correction codes; error statistics; maximum likelihood decoding; memoryless systems; time-varying systems; concatenated codes; constant composition inner codes; decoding; discrete memoryless channel; encoding; error correction codes; maximum distance separable outer codes; maximum likelihood decoding; random coding error exponent; time-varying randomly selected inner codes; universal codes; Block codes; Computer errors; Concatenated codes; Decoding; Equations; Information science; Memoryless systems; Mutual information; Network address translation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613277
Filename
613277
Link To Document