On the (2-1) Separating Weight of the Kerdock Code
Tools
Tools
Tools
Helleseth, Tor and Schaathun, Hans (2004) On the (2-1) Separating Weight of the Kerdock Code IEEE Transactions on Information Theory, 50 (12). pp. 3312-3315. ISSN 0018-9448
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 203Kb |
Abstract
Separating codes find applications in many fields including automata theory and digital fingerprinting. It is known that the Kerdock code of sufficient order is (2, 1)- and (2, 2)-separating, but the separating weight is only known by a lower bound due to Sagalovich. In this correspondence, we prove that the lower bound on the (2, 1)-separating weight is met with equality.
| Item Type: | Article |
|---|---|
| Additional Information: | Schaathun, Hans Georg with Tor Helleseth: On the (2,1)-separating weight of the Kerdock code , IEEE Trans. Inform. Theory, 50(12), December 2004, pages 3312-3315 © 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| ID Code: | 1903 |
| 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