A New Class of Codes for Fingerprinting Schemes

In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be used as fingerprinting codes. Then we show that by giving algebraic structure to the equidistant code, the tracing process can be accomplished by passing a modified version of the Viterbi algorithm through the trellis representing the code.