Show simple item record

hal.structure.identifierTexas A&M University System
dc.contributor.authorBOUTROS, Joseph
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorZÉMOR, Gilles
hal.structure.identifierDept. of Engineering, university of Cambridge
dc.contributor.authorGUILLEN I FABREGAS, Albert
dc.contributor.authorBIGLIERI, Ezio
dc.date.accessioned2024-04-04T02:47:36Z
dc.date.available2024-04-04T02:47:36Z
dc.date.created2008-07
dc.date.issued2008-07
dc.date.conference2008-07
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191659
dc.description.abstractEnA 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.isoen
dc.source.titleIEEE International Symposium on Information Theory 2008, ISIT 2008
dc.title.enGeneralized low-density codes with BCH constituents for full-diversity near-outage performance
dc.typeCommunication dans un congrès
dc.identifier.doi10.1109/ISIT.2008.4595094
dc.subject.halInformatique [cs]/Théorie de l'information [cs.IT]
bordeaux.page787-791
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleIEEE International Symposium on Information Theory 2008, ISIT 2008
bordeaux.countryCA
bordeaux.title.proceedingIEEE International Symposium on Information Theory 2008, ISIT 2008
bordeaux.conference.cityToronto
bordeaux.peerReviewedoui
hal.identifierhal-00311848
hal.version1
hal.invitednon
hal.proceedingsoui
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00311848v1
bordeaux.COinSctx_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


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record