DocumentCode :
640084
Title :
On the dimension of graph codes with Reed-Solomon component codes
Author :
Beelen, Peter ; Hoholdt, T. ; Pinero, Fernando ; Justesen, J.
Author_Institution :
Dept. of Appl. Math. & Comput. Sci., Tech. Univ. of Denmark, Lyngby, Denmark
fYear :
2013
fDate :
7-12 July 2013
Firstpage :
1227
Lastpage :
1231
Abstract :
We study a class of graph based codes with Reed-Solomon component codes as affine variety codes. We give a formulation of the exact dimension of graph codes in general. We give an algebraic description of these codes which makes the exact computation of the dimension of the graph codes easier.
Keywords :
Reed-Solomon codes; graph theory; Reed-Solomon component codes; affine variety codes; algebraic description; graph code dimension; Bipartite graph; Frequency modulation; Kernel; Parity check codes; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
ISSN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2013.6620422
Filename :
6620422
Link To Document :
بازگشت