Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound

DOI10.1007/978-3-319-66278-7_15zbMath1429.94085arXiv1705.03835OpenAlexW3104838269MaRDI QIDQ1705522

Daniel Heinlein, Sascha Kurz

Publication date: 16 March 2018

Full work available at URL: https://arxiv.org/abs/1705.03835

zbMATH Keywords

random network codingsubspace distanceconstant dimension codesinjection distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Related Items (11)

New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ The interplay of different metrics for the construction of constant dimension codes ⋮ Combining subspace codes ⋮ Subspace packings: constructions and bounds ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Subspace code based on flats in affine space over finite fields ⋮ Johnson type bounds for mixed dimension subspace codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Parallel sub-code construction for constant-dimension codes ⋮ Enhancing Echelon-Ferrers construction for constant dimension code

This page was built for publication: Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound