Bounds for weight distribution of weakly self-dual codes

Simple item page
dc.creatorRoychowdhury, Vwani P.
dc.creatorVatan, Farrokh
dc.date2001-04-02
dc.date.accessioned2026-07-07T08:18:08Z
dc.date.available2026-07-07T08:18:08Z
dc.descriptionUpper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on quantum computing. This new approach leads to much simpler proofs for such genre of bounds on the weight distributions of certain classes of codes. Moreover, in some cases, our bounds are improvements on the earlier bounds. These improvements are achieved, either by extending the range of the weights over which the bounds apply, or by extending the class of codes subjected to these bounds.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0104016
dc.identifierhttp://arxiv.org/abs/math/0104016
dc.identifierIEEE Transactions on Information Theory, vol. 47, no. 1, Jan. 2001, pp. 393-396
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134329
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subjectQuantum Physics
dc.subject94B65
dc.titleBounds for weight distribution of weakly self-dual codes
dc.typetext

Files

Collections

arXiv