Title :
Optimum distance profiles of linear block codes
Author :
Vinck, A. J Han ; Luo, Yuan
Author_Institution :
Inst. for Exp. Math., Duisburg-Essen Univ., Essen
Abstract :
In this paper, two kinds of optimum distance profiles of linear block codes are introduced to study how to include or exclude some basis codewords one by one while keeping the minimum distances (of the generated subcodes) as large as possible. One application is to serve a suitable code for the realization of the transport format combination indicators (TFCI) of some CDMA systems.
Keywords :
block codes; code division multiple access; linear codes; CDMA systems; TFCI; linear block codes; optimum distance profiles; transport format combination indicators; Block codes; Computer science; Dictionaries; Error correction; Error correction codes; Linear code; Mathematics; Multiaccess communication; Reed-Solomon codes; Upper bound;
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
DOI :
10.1109/ISIT.2008.4595331