DocumentCode
2257275
Title
Multilevel codes based on matrix completion
Author
Dabiri, Dariush ; Blake, Ian F.
Author_Institution
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
fYear
1995
fDate
17-22 Sep 1995
Firstpage
102
Abstract
Based on matrix completion algorithms, new constructions for algebraic multilevel codes are given. The constructions have low computational complexity and can be used for channels with combinations of burst and random errors
Keywords
algebraic geometric codes; channel coding; coding errors; computational complexity; error statistics; matrix algebra; random processes; telecommunication channels; algebraic multilevel codes; burst errors; channels; low computational complexity; matrix completion algorithms; random errors; Communication channels; Computational complexity; Computer errors; Convolutional codes; Decoding; Error correction codes; Interleaved codes; Vectors; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.531306
Filename
531306
Link To Document