University of Surrey

Test tubes in the lab Research in the ATI Dance Research

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. ISSN 0018-9448

[img]
Preview
PDF
SRF002709.pdf - Published Version

Download (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: ©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.
Related URLs:
Divisions: Faculty of Engineering and Physical Sciences > Electronic Engineering > Centre for Communication Systems Research
Depositing User: Melanie Hughes
Date Deposited: 07 Oct 2010 11:57
Last Modified: 23 Sep 2013 18:38
URI: http://epubs.surrey.ac.uk/id/eprint/2437

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800