Upper bounds on separating codes
Tools
Tools
Tools
Cohen, Gerard D. and Schaathun, H. (2004) Upper bounds on separating codes IEEE Transactions on Information Theory, 50 (5). ISSN 0018-9448
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 93Kb |
Abstract
We show how to compute the support weight distribution A/sub i//sup r/ for r/spl ges/k-d/sub 2//sup /spl perp//+3, where d/sub 2//sup /spl perp// is the second minimum support weight of a code, provided the weight enumerator of the dual code is known.
| Item Type: | Article |
|---|---|
| Additional Information: | This paper appears in: IEEE Transactions on Information Theory (2004) Volume 50,Issue 5 pp862-867 |
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| ID Code: | 1899 |
| Deposited By: | Mr Adam Field |
| Deposited On: | 27 May 2010 15:45 |
| Last Modified: | 26 Sep 2012 14:37 |
Document Downloads
Repository Staff Only: item control page