DocumentCode :
2001565
Title :
On the rank distance of cyclic codes
Author :
Sripati, U. ; Rajan, B. Sundar
Author_Institution :
Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India
fYear :
2003
fDate :
29 June-4 July 2003
Firstpage :
72
Abstract :
We study the rank-distance of primitive length (n=qm-1) linear cyclic codes over Fqm using the discrete Fourier transform (DFT) description of these codes.
Keywords :
cyclic codes; discrete Fourier transforms; linear codes; transform coding; DFT; discrete Fourier transform; linear cyclic code; primitive length; rank distance; Discrete Fourier transforms; Galois fields; Linear code; Reed-Solomon codes; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
Type :
conf
DOI :
10.1109/ISIT.2003.1228086
Filename :
1228086
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2001565
بازگشت