Generalized low-density codes with BCH constituents for full-diversity near-outage performance
| hal.structure.identifier | Texas A&M University System | |
| dc.contributor.author | BOUTROS, Joseph | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | ZÉMOR, Gilles | |
| hal.structure.identifier | Dept. of Engineering, university of Cambridge | |
| dc.contributor.author | GUILLEN I FABREGAS, Albert | |
| dc.contributor.author | BIGLIERI, Ezio | |
| dc.date.accessioned | 2024-04-04T02:47:36Z | |
| dc.date.available | 2024-04-04T02:47:36Z | |
| dc.date.created | 2008-07 | |
| dc.date.issued | 2008-07 | |
| dc.date.conference | 2008-07 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/191659 | |
| dc.description.abstractEn | A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. A classical GLD code for ergodic channels (e.g., the AWGN channel, the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more. | |
| dc.language.iso | en | |
| dc.source.title | IEEE International Symposium on Information Theory 2008, ISIT 2008 | |
| dc.title.en | Generalized low-density codes with BCH constituents for full-diversity near-outage performance | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1109/ISIT.2008.4595094 | |
| dc.subject.hal | Informatique [cs]/Théorie de l'information [cs.IT] | |
| bordeaux.page | 787-791 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | IEEE International Symposium on Information Theory 2008, ISIT 2008 | |
| bordeaux.country | CA | |
| bordeaux.title.proceeding | IEEE International Symposium on Information Theory 2008, ISIT 2008 | |
| bordeaux.conference.city | Toronto | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00311848 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00311848v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=IEEE%20International%20Symposium%20on%20Information%20Theory%202008,%20ISIT%202008&rft.date=2008-07&rft.spage=787-791&rft.epage=787-791&rft.au=BOUTROS,%20Joseph&Z%C3%89MOR,%20Gilles&GUILLEN%20I%20FABREGAS,%20Albert&BIGLIERI,%20Ezio&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||