Constructions of Grassmannian Simplices
hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
dc.contributor.author | CREIGNOU, Jean | |
dc.date.accessioned | 2024-04-04T02:54:40Z | |
dc.date.available | 2024-04-04T02:54:40Z | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/192291 | |
dc.description.abstractEn | In this article an explicit method (relying on representation theory) to construct packings in Grassmannian space is presented. Infinite families of configurations having only one non-trivial set of principal angles are found using 2-transitive groups. These packings are proved to reach the simplex bound and are therefore optimal w.r.t. the chordal distance. The construction is illustrated by an example on the symmetric group. Then some natural extends and consequences of this situation are given. | |
dc.language.iso | en | |
dc.subject.en | Explicit construction | |
dc.subject.en | Grassmannian packing | |
dc.subject.en | Space-time coding | |
dc.subject.en | Simplex bound | |
dc.subject.en | Wireless communication | |
dc.title.en | Constructions of Grassmannian Simplices | |
dc.type | Document de travail - Pré-publication | |
dc.subject.hal | Informatique [cs]/Théorie de l'information [cs.IT] | |
dc.subject.hal | Mathématiques [math]/Théorie de l'information et codage [math.IT] | |
dc.identifier.arxiv | cs/0703036 | |
bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
hal.identifier | hal-00135498 | |
hal.version | 1 | |
hal.audience | Non spécifiée | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-00135498v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=CREIGNOU,%20Jean&rft.genre=preprint |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |