Abstract:
We study the rank-distance of primitive length (n=q/sup m/-1) linear cyclic codes over F/sub q//sup m/ using the discrete Fourier transform (DFT) description of these cod...Show MoreMetadata
Abstract:
We study the rank-distance of primitive length (n=q/sup m/-1) linear cyclic codes over F/sub q//sup m/ using the discrete Fourier transform (DFT) description of these codes.
Date of Conference: 29 June 2003 - 04 July 2003
Date Added to IEEE Xplore: 15 September 2003
Print ISBN:0-7803-7728-1
References is not available for this document.
Contents References is not available for this document.
