On the (2,1)-separating weight of the Kerdock code
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.
kerdock code fingerprinting linear codes over z(4) separating systems