On Bounded Weight Codes
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | BACHOC, Christine | |
| dc.contributor.author | CHANDAR, Venkat | |
| hal.structure.identifier | Ministère de la Culture et de la communication, service du Livre et de la lecture, bureau du Patrimoine | |
| dc.contributor.author | COHEN, Gerard | |
| hal.structure.identifier | Télécom ParisTech | |
| dc.contributor.author | SOLE, Patrick | |
| dc.contributor.author | TCHAMKERTEN, Aslan | |
| dc.date.accessioned | 2024-04-04T02:20:53Z | |
| dc.date.available | 2024-04-04T02:20:53Z | |
| dc.date.created | 2010-09-19 | |
| dc.date.issued | 2011 | |
| dc.identifier.issn | 0018-9448 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/189527 | |
| dc.description.abstractEn | The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a non-asymptotic improvement of the second Johnson bound and are tight for certain values of the parameters. | |
| dc.language.iso | en | |
| dc.publisher | Institute of Electrical and Electronics Engineers | |
| dc.title.en | On Bounded Weight Codes | |
| dc.type | Article de revue | |
| dc.subject.hal | Mathématiques [math]/Théorie de l'information et codage [math.IT] | |
| dc.subject.hal | Informatique [cs]/Théorie de l'information [cs.IT] | |
| dc.identifier.arxiv | 1009.3657 | |
| bordeaux.journal | IEEE Transactions on Information Theory | |
| bordeaux.page | 6780-6787 | |
| bordeaux.volume | 57 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 10 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00911674 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00911674v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=IEEE%20Transactions%20on%20Information%20Theory&rft.date=2011&rft.volume=57&rft.issue=10&rft.spage=6780-6787&rft.epage=6780-6787&rft.eissn=0018-9448&rft.issn=0018-9448&rft.au=BACHOC,%20Christine&CHANDAR,%20Venkat&COHEN,%20Gerard&SOLE,%20Patrick&TCHAMKERTEN,%20Aslan&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||