This article is cited in 10 papers

Information Protection

Codes for Copyright Protection: The Case of Two Pirates

G. A. Kabatiansky

Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: The problem of finding so-called pirates via the minimum Hamming distance decoding is considered for the simplest case of two pirates. We prove that for all $q\ge3$ there exist “good” $q$-ary codes capable of finding at least one pirate by the minimum distance decoding in the Hamming metric.

UDC: 621.391.15

Received: 24.02.2005

 English version: Problems of Information Transmission, 2005, 41:2, 182–186

Bibliographic databases:

• 
•