1. A class of traceability codes
- Author
-
Jacob Löfvenberg, M. Svanstrom, and T. Lindkvist
- Subjects
Block code ,Theoretical computer science ,Computer science ,Concatenated error correction code ,ComputingMilieux_LEGALASPECTSOFCOMPUTING ,Hamming distance ,Coding theory ,Library and Information Sciences ,Luby transform code ,Linear code ,Online codes ,Computer Science Applications ,Reed–Solomon error correction ,Fountain code ,Turbo code ,Hamming(7,4) ,Forward error correction ,Low-density parity-check code ,Hamming code ,Raptor code ,Information Systems - Abstract
Traceability codes are identifiable parent property (IPP) codes with the additional requirement that the Hamming distance can be used to trace a parent of a word. Traceability codes can be used for constructing digital fingerprints in order to deter users from illegally copying digital data. We construct a class of traceability codes and determine the exact parameters of some of the codes in this class.
- Published
- 2002
- Full Text
- View/download PDF