Generalized LMRD code bounds for constant dimension codes

Titelangaben

Kurz, Sascha:
Generalized LMRD code bounds for constant dimension codes.
Bayreuth , 2020 . - 5 S.

Volltext

	Format: PDF Name: mrd_bound_arxiv.pdf Version: Veröffentlichte Version Verfügbar mit der Lizenz Creative Commons BY 4.0: Namensnennung
	Download (207kB)

Abstract

In random network coding so-called constant dimension codes (CDCs) are used for error correction and detection. Most of the largest known codes contain a lifted maximum rank distance (LMRD) code as a subset. For some special cases, Etzion and Silberstein have demonstrated that one can obtain tighter upper bounds on the maximum possible cardinality of CDCs if we assume that an LMRD code is contained. The range of applicable parameters was partially extended by Heinlein. Here we fully generalize those bounds, which also sheds some light on recent constructions.