COMBINING SUBSPACE CODES

被引：13

作者：

Cossidente, Antonio ^{[1
]}

Kurz, Sascha ^{[2
]}

Marino, Giuseppe ^{[3
]}

Pavese, Francesco ^{[4
]}

机构：

[1] Univ Basilicata, Dipartimento Matemat Informat & Econ, Contrada Macchia Romana, I-85100 Potenza, Italy

[2] Univ Bayreuth, Math Inst, Univ Str 30, D-95440 Bayreuth, Germany

[3] Univ Napoli Federico II, Dipartimento Matemat & Applicaz Renato Caccio, Complesso Univ Monte St Angelo, Cupa Nuova Cintia 21, I-80126 Naples, Italy

[4] Politecn Bari, Dipartimento Meccan Matemat & Management, Via Orabona 4, I-70125 Bari, Italy

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2021年

关键词：

Constant-dimension subspace code; finite projective geometry; network coding; CONSTANT DIMENSION CODES; CONSTRUCTION; BOUNDS; SPACES;

D O I：

10.3934/amc.2021007

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In the context of constant-dimension subspace codes, an important problem is to determine the largest possible size A(q)(n, d; k) of codes whose codewords are k-subspaces of F-q(n) with minimum subspace distance d. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant-dimension subspace codes for many parameters, including A(q)(10, 4; 5), A(q)(12, 4; 4), A(q)(12, 6, 6) and A(q)(16, 4; 4).

引用

页码：536 / 550

页数：15

共 41 条

[1]

[Anonymous], 1954, Mathematische Zeitschrift, DOI DOI 10.1007/BF01187370

[2]

Beutelspacher A., 1974, GEOMETRIAE DEDICATA, V3, P35

[3] New Lower Bounds for Binary Constant-Dimension Subspace Codes [J].