On the Rank Distance of Cyclic codes

Sripati, U and Rajan, Sundar B (2003) On the Rank Distance of Cyclic codes. In: IEEE International Symposium on Information Theory, 2003, 29 June-4 July, Yokohama, Japan, p. 72.

Preview

PDF OntheRank_Feb27th.pdf Download (132kB)

Abstract

We study the rank-distance of primitive length $(n = q^m - 1)$ linear cyclic codes over $F_{q^m}$ using the Discrete Fourier Transform (DFT) description of these codes.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	01 May 2007
Last Modified:	19 Sep 2010 04:36
URI:	http://eprints.iisc.ac.in/id/eprint/10148

Actions (login required)

View Item