On the rank distance of cyclic codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 72-

  Sripati, U ^a   Rajan, B Sundar ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; DISCRETE FOURIER TRANSFORMS; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; SET THEORY; VECTORS;

CYCLIC CODES; CYCLOTOMIC COSET; LINEAR CODES; RANK DISTANCE; REED-SOLOMON CODES; WEIGHT DISTRIBUTION;

BINARY CODES;

EID: 0141904744     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228086     Document Type: Conference Paper

References (2)

1. R.E.Blahut, Theory and Practice of Error Control Codes, Addison Wesley, 1983.
2. E. M. Gabidulin, "Theory of Codes with Maximum Rank Distance," Problemy Peredachi Informatsii, 21, 99.3-14, Jan.-Mar. 1985.