On the (2-1) Separating Weight of the Kerdock Code
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.
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.
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Date :||1 December 2004|
|Identification Number :||https://doi.org/10.1109/TIT.2004.838106|
|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.|
|Depositing User :||Mr Adam Field|
|Date Deposited :||27 May 2010 14:45|
|Last Modified :||23 Sep 2013 18:35|
Actions (login required)
Downloads per month over past year