ON PRIMITIVE CONSTANT DIMENSION CODES AND A GEOMETRICAL SUNFLOWER BOUND

被引:4
|
作者
Barrolleta, Roland D. [1 ]
Suarez-Canedo, Emilio [1 ]
Storme, Leo [2 ]
Vandendriessche, Peter [2 ]
机构
[1] Univ Autonoma Barcelona, Dept Engn Informacio & Comunicac, Edifici Q, E-08193 Barcelona, Spain
[2] Dept Math WE01, Krijgslaan 281,Bldg S25, B-9000 Ghent, Belgium
关键词
Subspace codes; constant intersection dimension codes; rank codes; finite geometry; Galois geometry; SUBSPACE; SETS;
D O I
10.3934/amc.2017055
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:757 / 765
页数:9
相关论文
共 50 条
  • [41] Construction of optimal constant-dimension subspace codes
    Pullan, Wayne
    Wu, Xin-Wen
    Liu, Zihui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1709 - 1719
  • [42] Some constant weight codes from primitive permutation groups
    Smith, Derek H.
    Montemanni, Roberto
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (04):
  • [43] On the Svanstrom bound for ternary constant-weight codes
    Fu, FW
    Klove, T
    Luo, Y
    Wei, VK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (05) : 2061 - 2064
  • [44] A MODIFICATION OF THE ZINOVIEV LOWER BOUND FOR CONSTANT WEIGHT CODES
    HONKALA, I
    HAMALAINEN, H
    KAIKKONEN, M
    DISCRETE APPLIED MATHEMATICS, 1985, 11 (03) : 307 - 310
  • [45] New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
    Xu, Liqing
    Chen, Hao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (09) : 6315 - 6319
  • [46] Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
    Li, Fagang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (05) : 2760 - 2764
  • [47] Construction of constant dimension codes via improved inserting construction
    Yongfeng Niu
    Qin Yue
    Daitao Huang
    Applicable Algebra in Engineering, Communication and Computing, 2023, 34 : 1045 - 1062
  • [48] Generalized block inserting for constructing new constant dimension codes
    Xiaoqin Hong
    Xiwang Cao
    Cryptography and Communications, 2023, 15 : 1 - 15
  • [49] Improving Wireless Network Throughput with Constant Dimension Subspace Codes
    Bardestani, Fatemeh
    Jako, Zoltan
    Knapp, Adam
    Imre, Sandor
    Fazekas, Peter
    2014 9TH INTERNATIONAL SYMPOSIUM ON COMMUNICATION SYSTEMS, NETWORKS & DIGITAL SIGNAL PROCESSING (CSNDSP), 2014, : 508 - 512
  • [50] A graham-sloane type construction of constant dimension codes
    Xia, Shu-Tao
    2008 FOURTH WORKSHOP ON NETWORK CODING, THEORY, AND APPLICATIONS: NETCOD 2008, PROCEEDINGS, 2008, : 121 - 125