On the (2,1)-Separating Weight of the Kerdock Code
Helleseth, Tor and Schaathun, Hans Georg (2004) On the (2,1)-Separating Weight of the Kerdock Code IEEE Transactions on Information Theory, 50 (12). pp. 3312-3315.
SRF002709.pdf - Version of Record
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 > Electronic Engineering > Centre for Communication Systems Research|
|Date :||December 2004|
|Identification Number :||https://doi.org/10.1109/TIT.2004.838106|
|Related URLs :|
|Additional Information :||©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 :||Melanie Hughes|
|Date Deposited :||07 Oct 2010 11:57|
|Last Modified :||23 Sep 2013 18:38|
Actions (login required)
Downloads per month over past year