Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

Coset construction for subspace codes

URN to cite this document: urn:nbn:de:bvb:703-epub-2654-3

Title data

Heinlein, Daniel ; Kurz, Sascha:
Coset construction for subspace codes.
Bayreuth , 2015 . - 17 S.

[img] PDF
paper_coset_arxiv.pdf - Published Version
Available under License Creative Commons BY 3.0: Attribution .

Download (400kB)

Project information

Project title:
Project's official titleProject's id
Ganzzahlige Optimierungsmodelle für Subspace Codes und endliche GeometrieNo information

Project financing: Deutsche Forschungsgemeinschaft

Abstract

One of the main problems of the young research area of network coding is to compute good lower and upper bounds of the achievable so-called subspace codes in PG(n,q) for a given minimal distance. Here we generalize a construction of Etzion and Silberstein to a wide range of parameters. This construction, named coset construction, improves several of the previously best known subspace codes and attains the MRD bound for an infinite family of parameters.

Further data

Item Type: Preprint, postprint
Keywords: Constant dimension codes; subspace codes; subspace distance; Echelon-Ferrers construction
Subject classification: MSC: 05B25, 51E20 (51E22, 51E23)
DDC Subjects: 000 Computer Science, information, general works > 004 Computer science
500 Science > 510 Mathematics
Institutions of the University: Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics in Economy
Language: English
Originates at UBT: Yes
URN: urn:nbn:de:bvb:703-epub-2654-3
Date Deposited: 14 Jan 2016 10:46
Last Modified: 20 Mar 2019 15:16
URI: https://epub.uni-bayreuth.de/id/eprint/2654

Downloads

Downloads per month over past year