On the (2,1)-Separating Weight of the Kerdock Code

Tor Helleseth; Hans Georg Schaathun

doi:10.1109/TIT.2004.838106

Back

On the (2,1)-Separating Weight of the Kerdock Code

Journal article

Open access

Peer reviewed

On the (2,1)-Separating Weight of the Kerdock Code

Tor Helleseth and Hans Georg Schaathun

IEEE Transactions on Information Theory, Vol.50(12), pp.3312-3315

12/2004

DOI: https://doi.org/10.1109/TIT.2004.838106

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.

Files and links (3)

pdf

SRF002709198.47 kBDownload View

Text Open Access

url

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1362916View

Published (Version of record)

url

http://ieeexplore.ieee.orgView

Metrics

149 File views/ downloads

40 Record Views

Details

Title: On the (2,1)-Separating Weight of the Kerdock Code
Creators: Tor Helleseth
Hans Georg Schaathun
Publication Details: IEEE Transactions on Information Theory, Vol.50(12), pp.3312-3315
Publisher: Institute of Electrical and Electronics Engineers
Date published: 12/2004
Date submitted: 07/10/2010
Identifiers: 99512132202346
Academic Unit: School of Computer Science and Electronic Engineering
Resource Type: Journal article

On the (2,1)-Separating Weight of the Kerdock Code

Abstract

Files and links (3)

Metrics

Details

Usage Policy