Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Titel | 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) |
Redacteuren | E. Martínez-Moro, I. Kotsireas, S. Szabo |
Plaats van productie | Valladolid |
Uitgeverij | University of Valladolid |
Pagina's | 1-5 |
Status | Gepubliceerd - 2014 |
Evenement | conference; 20th Conference on Applications of Computer Algebra; 2014-07-09; 2014-07-12 - Duur: 9 jul. 2014 → 12 jul. 2014 |
Congres
Congres | conference; 20th Conference on Applications of Computer Algebra; 2014-07-09; 2014-07-12 |
---|---|
Periode | 9/07/14 → 12/07/14 |
Ander | 20th Conference on Applications of Computer Algebra |