Afficher la notice abrégée

hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierCentrum voor Wiskunde en Informatica [CWI]
hal.structure.identifierUniversiteit Leiden = Leiden University
dc.contributor.authorMIRANDOLA, Diego
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorZÉMOR, Gilles
dc.date.created2015
dc.date.issued2015
dc.identifier.issn0018-9448
dc.description.abstractEnWe characterize product-maximum distance separable (PMDS) pairs of linear codes, i.e., pairs of codes C and D whose product under coordinatewise multiplication has maximum possible minimum distance as a function of the code length and the dimensions dim C and dim D. We prove in particular, for C = D, that if the square of the code C has minimum distance at least 2, and (C, C) is a PMDS pair, then either C is a generalized Reed-Solomon code, or C is a direct sum of self-dual codes. In passing we establish coding-theory analogues of classical theorems of additive combinatorics.
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers
dc.title.enCritical pairs for the Product Singleton Bound
dc.typeArticle de revue
dc.identifier.doi10.1109/TIT.2015.2450207
dc.subject.halMathématiques [math]/Théorie de l'information et codage [math.IT]
dc.identifier.arxiv1501.06419
bordeaux.journalIEEE Transactions on Information Theory
bordeaux.page4928-4937
bordeaux.volume61
bordeaux.issue9
bordeaux.peerReviewedoui
hal.identifierhal-01261399
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01261399v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=IEEE%20Transactions%20on%20Information%20Theory&rft.date=2015&rft.volume=61&rft.issue=9&rft.spage=4928-4937&rft.epage=4928-4937&rft.eissn=0018-9448&rft.issn=0018-9448&rft.au=MIRANDOLA,%20Diego&Z%C3%89MOR,%20Gilles&rft.genre=article


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée