visitante ::
identificación
|
|||||||||||||||
Buscar | Enviar | Ayuda | Servicio de Bibliotecas | Sobre el DDD | Català English Español |
Página principal > Artículos > Artículos publicados > On primitive constant dimension codes and a geometrical sunflower bound |
Fecha: | 2017 |
Resumen: | In this paper we study subspace codes with constant intersection dimension (SCIDs). We investigate the largest possible dimension spanned by such a code that can yield non-sunflower codes, and classify the examples attaining equality in that bound as one of two infinite families. We also construct a new infinite family of primitive SCIDs. |
Ayudas: | Ministerio de Educación y Ciencia TIN2013-40524-P Agència de Gestió d'Ajuts Universitaris i de Recerca 2014/SGR-691 |
Nota: | Altres ajuts: COST project Random Network Coding and Designs over GF(q) (COST IC-1104) |
Derechos: | Tots els drets reservats. |
Lengua: | Anglès |
Documento: | Article ; recerca ; Versió acceptada per publicar |
Materia: | Subspace codes ; Constant intersection dimension codes ; Rank codes ; Finite geometry ; Galois geometry |
Publicado en: | Advances in mathematics of communications, Vol. 11, issue 4 (2017) , p. 757-765, ISSN 1930-5338 |
Post-print 9 p, 1.5 MB |