Codes for Copyright Protection: The Case of Two Pirates

Authors:
G. A. Kabatiansky
Affiliations:
Institute for Information Transmission Problems, RAS, Moscow
Venue:
Problems of Information Transmission
Year:
2005

Citing 5
Cited 2

On the extremal combinatorics of the Hamming space

Journal of Combinatorial Theory Series A
On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

SIAM Journal on Discrete Mathematics
Tracing Traitors

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Tracing traitors

IEEE Transactions on Information Theory

Separating codes and a new combinatorial search model

Problems of Information Transmission
Traceability codes

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

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