Generalized linkage construction for constant-dimension codes

Daniel Heinlein

doi:10.1109/TIT.2020.3038272

Generalized linkage construction for constant-dimension codes

Daniel Heinlein

Information Theory

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

9 Sitaatiot (Scopus)

Abstrakti

A constant-dimension code (CDC) is a set of sub-spaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the parallel linkage construction, to the generalized linkage construction and the multiblock generalized linkage construction which in turn yield many improved lower bounds for the cardinalities of CDCs; a quantity not known in general.

Alkuperäiskieli	Englanti
Artikkeli	9261394
Sivut	705-715
Sivumäärä	11
Julkaisu	IEEE Transactions on Information Theory
Vuosikerta	67
Numero	2
Varhainen verkossa julkaisun päivämäärä	2020
DOI - pysyväislinkit	https://doi.org/10.1109/TIT.2020.3038272
Tila	Julkaistu - helmik. 2021
OKM-julkaisutyyppi	A1 Julkaistu artikkeli, soviteltu

Pääsy asiakirjaan

10.1109/TIT.2020.3038272

https://arxiv.org/abs/1910.11195

OpenUrl-saatavuus

Koko teksti

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

@article{1c76b18f05bc4e81931cd6d104528cb5,

title = "Generalized linkage construction for constant-dimension codes",

abstract = "A constant-dimension code (CDC) is a set of sub-spaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the parallel linkage construction, to the generalized linkage construction and the multiblock generalized linkage construction which in turn yield many improved lower bounds for the cardinalities of CDCs; a quantity not known in general.",

keywords = "combinatorics, constant-dimension codes, Couplings, Encoding, Extraterrestrial measurements, Finite projective spaces, lifted maximum rank-distance bound, Linear matrix inequalities, Manuals, Matrix decomposition, maximum rank-distance codes, rank distance, rank-metric codes, subspace codes, subspace-distance, Upper bound",

author = "Daniel Heinlein",

year = "2021",

month = feb,

doi = "10.1109/TIT.2020.3038272",

language = "English",

volume = "67",

pages = "705--715",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE",

number = "2",

}

TY - JOUR

T1 - Generalized linkage construction for constant-dimension codes

AU - Heinlein, Daniel

PY - 2021/2

Y1 - 2021/2

N2 - A constant-dimension code (CDC) is a set of sub-spaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the parallel linkage construction, to the generalized linkage construction and the multiblock generalized linkage construction which in turn yield many improved lower bounds for the cardinalities of CDCs; a quantity not known in general.

AB - A constant-dimension code (CDC) is a set of sub-spaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the parallel linkage construction, to the generalized linkage construction and the multiblock generalized linkage construction which in turn yield many improved lower bounds for the cardinalities of CDCs; a quantity not known in general.

KW - combinatorics

KW - constant-dimension codes

KW - Couplings

KW - Encoding

KW - Extraterrestrial measurements

KW - Finite projective spaces

KW - lifted maximum rank-distance bound

KW - Linear matrix inequalities

KW - Manuals

KW - Matrix decomposition

KW - maximum rank-distance codes

KW - rank distance

KW - rank-metric codes

KW - subspace codes

KW - subspace-distance

KW - Upper bound

UR - http://www.scopus.com/inward/record.url?scp=85098791699&partnerID=8YFLogxK

U2 - 10.1109/TIT.2020.3038272

DO - 10.1109/TIT.2020.3038272

M3 - Article

AN - SCOPUS:85098791699

VL - 67

SP - 705

EP - 715

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

M1 - 9261394

ER -

Generalized linkage construction for constant-dimension codes

Abstrakti

Pääsy asiakirjaan

OpenUrl-saatavuus

Muut tiedostot ja linkit

Sormenjälki

Siteeraa tätä