Abstract
This paper investigates the rank weight enumerator of a code over L, where L is a nite extension of a eld K. This is a generalization of the case where K = Fq and L = Fqm of Gabidulin codes to arbitrary characteristic. We use the notion of counting polynomials, to dene the (extended) rank weight enumerator, since in this generality the set of codewords of a given rank weight is no longer nite. Also the extended and generalized rank weight enumerator are studied in analogy with previous work on codes with respect to the Hamming metric.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
