Bounds for the weight distribution of weakly self-dual codes
From MaRDI portal
Publication:4544482
DOI10.1109/18.904542zbMATH Open1019.94035arXivmath/0104016OpenAlexW2162012520MaRDI QIDQ4544482FDOQ4544482
Vwani Roychowdhury, Farrokh Vatan
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Upper 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.
Full work available at URL: https://arxiv.org/abs/math/0104016
Hilbert spaceweight distributionquantum computingunitary operationsupper boundsbinary weakly self-dual codes
Recommendations
- Weight distributions of cyclic self-dual codes 👍 👎
- Title not available (Why is that?) 👍 👎
- On the weight distribution of linear codes having dual distance d'<or=k 👍 👎
- The weight distributions of constacyclic codes 👍 👎
- A duality theorem for the weight distribution of some cyclic codes 👍 👎
- Title not available (Why is that?) 👍 👎
- Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes 👍 👎
- On weights in duadic codes 👍 👎
- Title not available (Why is that?) 👍 👎
- An upper bound on the weight distribution of some systematic codes (Corresp.) 👍 👎
This page was built for publication: Bounds for the weight distribution of weakly self-dual codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544482)
