Abstract

Viewing the codewords of an [n, k] linear code over a field F(q/sup m/) as m/spl times/n matrices over F/sub q/ by expanding each entry of the codeword with respect to an F/sub q/-basis of F(q/sup m/), the rank weight of a codeword is the rank over F/sub q/ of the corresponding matrix and the rank of the code is the minimum rank weight among all non-zero codewords. For m/spl ges/n-k+1, codes with maximum possible rank distance, called maximum rank distance (MRD) codes have been studied previously. We study codes with maximum possible rank distance for the cases m/spl les/n-k+1, calling them full rank distance (FRD) codes. Generator matrices of FRD codes are characterized.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.