2013
DOI: 10.1134/s0032946013010043
|View full text |Cite
|
Sign up to set email alerts
|

Rank subcodes in multicomponent network coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0
1

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(16 citation statements)
references
References 11 publications
0
15
0
1
Order By: Relevance
“…This approach has led to the area of subspace codes and specifically to intensive research efforts on constructions of subspace codes with large subspace distance [23,21,25,10,14,9,16,12,15,11,24,29,17]. Most of the research focuses on constant-dimension codes (CDC's), that is, codes where all subspaces have the same dimension.…”
Section: Introductionmentioning
confidence: 99%
“…This approach has led to the area of subspace codes and specifically to intensive research efforts on constructions of subspace codes with large subspace distance [23,21,25,10,14,9,16,12,15,11,24,29,17]. Most of the research focuses on constant-dimension codes (CDC's), that is, codes where all subspaces have the same dimension.…”
Section: Introductionmentioning
confidence: 99%
“…A greedy-type approach has been considered by Alexander Shishkin, see [14,1]. In [8,7] the authors considered block designs as skeleton codes. The most effective general recursive construction is the linkage construction and its generalization, see subsection 3.2.…”
Section: Previous Known Resultsmentioning
confidence: 99%
“…The construction was described in [4] by means of q-cyclic MRD codes, but it can also be interpreted using systematic shortened MRD codes, see also [8], [12].…”
Section: Known Results and Problem Statementmentioning
confidence: 99%