Bounds for codes in the Grassmann manifold

Christine Bachoc, Yael Ben-Haim, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Upper bounds are derived for codes in the Grassmann manifold with given minimum chordal distance. They stem from upper bounds for codes in the product of unit spheres and projective spaces. The new bounds are asymptotically better than the previously known ones.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages1796-1800
Number of pages5
DOIs
StatePublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 24 Jun 200729 Jun 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period24/06/0729/06/07

Fingerprint

Dive into the research topics of 'Bounds for codes in the Grassmann manifold'. Together they form a unique fingerprint.

Cite this