Sripati, U. ; Sundar Rajan, B. (2003) On the rank distance of cyclic codes In: Proceedings of the IEEE International Symposium on Information Theory, 2003, 29 June-4 July 2003, Yokohama, Japan.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/1228086/
Related URL: http://dx.doi.org/10.1109/ISIT.2003.1228086
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111235 |
| Deposited On: | 08 Dec 2017 10:36 |
| Last Modified: | 08 Dec 2017 10:36 |
Repository Staff Only: item control page
