Codes for copyright protection: The case of two pirates

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


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 ≥ 3 there exist "good" q-ary codes capable of finding at least one pirate by the minimum distance decoding in the Hamming metric.

Original languageEnglish
Pages (from-to)182-186
Number of pages5
JournalProblems of information transmission
Issue number2
Publication statusPublished - Apr 2005
Externally publishedYes


Dive into the research topics of 'Codes for copyright protection: The case of two pirates'. Together they form a unique fingerprint.

Cite this