New lower bounds for constant dimension codes

Natalia Silberstein; Anna Lena Trautmann

doi:10.1109/ISIT.2013.6620279

New lower bounds for constant dimension codes

Natalia Silberstein, Anna Lena Trautmann

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

12 Scopus citations

Abstract

This paper provides new constructive lower bounds for constant dimension codes, using Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension codes are presented. The examples of codes obtained by these constructions are the largest known constant dimension codes for the given parameters.

Original language	English
Title of host publication	2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages	514-518
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2013.6620279
State	Published - 19 Dec 2013
Externally published	Yes
Event	2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: 7 Jul 2013 → 12 Jul 2013

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/Territory	Turkey
City	Istanbul
Period	7/07/13 → 12/07/13

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2013.6620279

Cite this

@inproceedings{a0e1e78d30704303b3cd114e3a65eca4,

title = "New lower bounds for constant dimension codes",

abstract = "This paper provides new constructive lower bounds for constant dimension codes, using Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension codes are presented. The examples of codes obtained by these constructions are the largest known constant dimension codes for the given parameters.",

author = "Natalia Silberstein and Trautmann, \{Anna Lena\}",

year = "2013",

month = dec,

day = "19",

doi = "10.1109/ISIT.2013.6620279",

language = "English",

isbn = "9781479904464",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "514--518",

booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",

note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",

}

Silberstein, N & Trautmann, AL 2013, New lower bounds for constant dimension codes. in 2013 IEEE International Symposium on Information Theory, ISIT 2013., 6620279, IEEE International Symposium on Information Theory - Proceedings, pp. 514-518, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/07/13. https://doi.org/10.1109/ISIT.2013.6620279

TY - GEN

T1 - New lower bounds for constant dimension codes

AU - Silberstein, Natalia

AU - Trautmann, Anna Lena

PY - 2013/12/19

Y1 - 2013/12/19

N2 - This paper provides new constructive lower bounds for constant dimension codes, using Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension codes are presented. The examples of codes obtained by these constructions are the largest known constant dimension codes for the given parameters.

AB - This paper provides new constructive lower bounds for constant dimension codes, using Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension codes are presented. The examples of codes obtained by these constructions are the largest known constant dimension codes for the given parameters.

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

U2 - 10.1109/ISIT.2013.6620279

DO - 10.1109/ISIT.2013.6620279

M3 - Conference contribution

AN - SCOPUS:84890362199

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 514

EP - 518

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013

Y2 - 7 July 2013 through 12 July 2013

ER -

New lower bounds for constant dimension codes

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this