Subspace code constructions

被引：3

作者：

Cossidente, Antonio ^{[1
]}

Marino, Giuseppe ^{[2
]}

Pavese, Francesco ^{[3
]}

机构：

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

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

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

来源：

RICERCHE DI MATEMATICA | 2022年 / 71卷 / 01期

关键词：

Circumscribed bundle; Constant dimension subspace code; Singer cyclic group; MIXED PARTITIONS;

D O I：

10.1007/s11587-020-00521-9

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We improve on the lower bound of the maximum number of planes of PG(8, q) mutually intersecting in at most one point leading to the following lower bound: A(q) (9, 4; 3) >= q(12) + 2q(8) + 2q(7) + q(6) + q(5) + q(4) + 1. We also construct two new nonequivalent (6, (q(3) - 1)(q(2) + q + 1), 4; 3) q-constant dimension subspace orbit-codes.

引用

页码：1 / 16

页数：16

共 29 条

[21]

HUPPERT B, 1967, GRUNDLEHREN MATH WIS

[22] Coding for errors and erasures in random network coding [J].