2020
DOI: 10.48550/arxiv.2008.09944
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Parameter-controlled inserting constructions of constant dimension subspace codes

Abstract: A basic problem in constant dimension subspace coding is to determine the maximal possible size A q (n, d, k) of a set of k-dimensional subspaces in F n q such that the subspace distance satisfies dis(U, V ) = 2k − 2 dim(U ∩ V ) ≥ d for any two different k-dimensional subspaces U and V in this set. In this paper we propose new parameter-controlled inserting constructions of constant dimension subspace codes. These inserting constructions are flexible because they are controlled by parameters. Several new bette… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…Constrcution 3.5 is similar to constructions in [3,22,28,29]. However, the subspace distance in our constructions only relies on Hamming distance of identifying vectors, inverse identifying vectors and bilateral identifying vectors.…”
Section: 3mentioning
confidence: 99%
See 2 more Smart Citations
“…Constrcution 3.5 is similar to constructions in [3,22,28,29]. However, the subspace distance in our constructions only relies on Hamming distance of identifying vectors, inverse identifying vectors and bilateral identifying vectors.…”
Section: 3mentioning
confidence: 99%
“…In [22] Lao et al presented a parameter-controlled inserting construction. Following their idea, we give two lemmas as follows.…”
Section: 3mentioning
confidence: 99%
See 1 more Smart Citation