New LMRD code bounds for constant dimension codes and improved constructions

D. Heinlein

doi:10.1109/TIT.2019.2905002

New LMRD code bounds for constant dimension codes and improved constructions

D. Heinlein

University of Bayreuth

Research output: Contribution to journal › Article › Scientific › peer-review

11 Citations (Scopus)

Abstract

We prove upper bounds for the cardinality of constant dimension codes (CDC) which contain a lifted maximum rank distance code (LMRD code) as subset. Thereby we cover all parameters fulfilling k < 3d=2, where k is the codeword dimension and d is the minimum subspace distance. The proofs of the bounds additionally show that an LMRD code L can be unioned with a CDC C (of fitting parameters) without violating the subspace distance condition iff each codeword of C intersects the special subspace of L in at least dimension d=2. This connection is used to find new largest and sometimes bound achieving CDCs for small parameters.

Original language	English
Article number	8667306
Pages (from-to)	4822-4830
Number of pages	9
Journal	IEEE Transactions on Information Theory
Volume	65
Issue number	8
Early online date	2019
DOIs	https://doi.org/10.1109/TIT.2019.2905002
Publication status	Published - 1 Aug 2019
MoE publication type	A1 Journal article-refereed

Keywords

Upper bound
Finite element analysis
Indexes
Extraterrestrial measurements
Encoding
Finite projective spaces
constant dimension codes
subspace codes
subspace distance
rank distance
maximum rank distance codes
lifted maximum rank distance code bound
combinatorics

Access to Document

10.1109/TIT.2019.2905002

Cite this

@article{6cc7aac3ba884f7a99faaecd305d4bee,

title = "New LMRD code bounds for constant dimension codes and improved constructions",

abstract = "We prove upper bounds for the cardinality of constant dimension codes (CDC) which contain a lifted maximum rank distance code (LMRD code) as subset. Thereby we cover all parameters fulfilling k < 3d=2, where k is the codeword dimension and d is the minimum subspace distance. The proofs of the bounds additionally show that an LMRD code L can be unioned with a CDC C (of fitting parameters) without violating the subspace distance condition iff each codeword of C intersects the special subspace of L in at least dimension d=2. This connection is used to find new largest and sometimes bound achieving CDCs for small parameters.",

keywords = "Upper bound, Finite element analysis, Indexes, Extraterrestrial measurements, Encoding, Finite projective spaces, constant dimension codes, subspace codes, subspace distance, rank distance, maximum rank distance codes, lifted maximum rank distance code bound, combinatorics",

author = "D. Heinlein",

year = "2019",

month = aug,

day = "1",

doi = "10.1109/TIT.2019.2905002",

language = "English",

volume = "65",

pages = "4822--4830",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE",

number = "8",

}

TY - JOUR

T1 - New LMRD code bounds for constant dimension codes and improved constructions

AU - Heinlein, D.

PY - 2019/8/1

Y1 - 2019/8/1

N2 - We prove upper bounds for the cardinality of constant dimension codes (CDC) which contain a lifted maximum rank distance code (LMRD code) as subset. Thereby we cover all parameters fulfilling k < 3d=2, where k is the codeword dimension and d is the minimum subspace distance. The proofs of the bounds additionally show that an LMRD code L can be unioned with a CDC C (of fitting parameters) without violating the subspace distance condition iff each codeword of C intersects the special subspace of L in at least dimension d=2. This connection is used to find new largest and sometimes bound achieving CDCs for small parameters.

AB - We prove upper bounds for the cardinality of constant dimension codes (CDC) which contain a lifted maximum rank distance code (LMRD code) as subset. Thereby we cover all parameters fulfilling k < 3d=2, where k is the codeword dimension and d is the minimum subspace distance. The proofs of the bounds additionally show that an LMRD code L can be unioned with a CDC C (of fitting parameters) without violating the subspace distance condition iff each codeword of C intersects the special subspace of L in at least dimension d=2. This connection is used to find new largest and sometimes bound achieving CDCs for small parameters.

KW - Upper bound

KW - Finite element analysis

KW - Indexes

KW - Extraterrestrial measurements

KW - Encoding

KW - Finite projective spaces

KW - constant dimension codes

KW - subspace codes

KW - subspace distance

KW - rank distance

KW - maximum rank distance codes

KW - lifted maximum rank distance code bound

KW - combinatorics

UR - https://www.scopus.com/pages/publications/85069478613

U2 - 10.1109/TIT.2019.2905002

DO - 10.1109/TIT.2019.2905002

M3 - Article

SN - 0018-9448

VL - 65

SP - 4822

EP - 4830

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 8

M1 - 8667306

ER -

New LMRD code bounds for constant dimension codes and improved constructions

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Construction and Classification of Discrete Mathematic Structures

Cite this

New LMRD code bounds for constant dimension codes and improved constructions

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Projects

Construction and Classification of Discrete Mathematic Structures

Cite this