|
Problemy Peredachi Informatsii, 2005, Volume 41, Issue 2, Pages 123–127
(Mi ppi101)
|
|
|
|
This article is cited in 10 scientific papers (total 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.
Received: 24.02.2005
Citation:
G. A. Kabatiansky, “Codes for Copyright Protection: The Case of Two Pirates”, Probl. Peredachi Inf., 41:2 (2005), 123–127; Problems Inform. Transmission, 41:2 (2005), 182–186
Linking options:
https://www.mathnet.ru/eng/ppi101 https://www.mathnet.ru/eng/ppi/v41/i2/p123
|
Statistics & downloads: |
Abstract page: | 696 | Full-text PDF : | 274 | References: | 53 |
|