Abstract
This paper investigates the rank weight enumerator of a code over L, where L is a finite extension of a field K. This is a generalization of the case where K = F_q and L = F_{q^m} of Gabidulin codes to arbitrary characteristic. We use the notion of counting polynomials, to define the (extended) rank weight enumerator, since in this generality the set of codewords of a given rank weight is no longer finite. Also the extended and generalized rank weight enumerator are studied in analogy with previous work on codes with respect to the Hamming metric.
| Original language | English |
|---|---|
| Title of host publication | Computer Algebra in Coding Theory and Cryptography (Special Session at 20th Conference on Applications of Computer Algebra, ACA 2014, New York NY, USA, July 9-12, 2014) |
| Editors | E. Martínez-Moro, I. Kotsireas, S. Szabo |
| Place of Publication | Valladolid |
| Publisher | University of Valladolid |
| Pages | 1-5 |
| Publication status | Published - 2014 |
| Event | conference; 20th Conference on Applications of Computer Algebra; 2014-07-09; 2014-07-12 - Duration: 9 Jul 2014 → 12 Jul 2014 |
Conference
| Conference | conference; 20th Conference on Applications of Computer Algebra; 2014-07-09; 2014-07-12 |
|---|---|
| Period | 9/07/14 → 12/07/14 |
| Other | 20th Conference on Applications of Computer Algebra |