Codes for copyright protection: The case of two pirates

被引：5

作者：

Kabatiansky G.A. ^{[1
]}

机构：

[1] Institute for Information Transmission Problems, RAS, Moscow

来源：

Problems of Information Transmission | 2005年 / 41卷 / 2期

基金：

俄罗斯基础研究基金会;

关键词：

System Theory; Minimum Distance; Copyright Protection; Distance Decode;

D O I：

10.1007/s11122-005-0022-6

中图分类号：

学科分类号：

摘要：

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. © 2005 Pleiades Publishing, Inc.

引用

页码：182 / 186

页数：4

共 6 条

[1]

Korner J., On the Extremal Combinatorics of the Hamming space, J. Combin. Theory, Ser. A, 71, pp. 112-126, (1995)

[2]

Hollmann H.D.L., van Lint J.H., Linnartz J.-P., Tolhuizen L.M.G.M., On Codes with the Identifiable Parent Property, J. Combin. Theory, Ser. A, 82, pp. 121-133, (1998)

[3]

Chor B., Fiat A., Naor M., Tracing Traitors, Advances in Cryptology - EUROCRYPT'94, 839, pp. 257-270, (1994)

[4]

Chor B., Fiat A., Naor M., Pinkas B., Tracing Traitors, IEEE Trans. Inform. Theory, 46, 3, pp. 893-910, (2000)

[5]

Barg A., Cohen G., Encheva S., Kabatiansky G., Zemor G., A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents, SIAM J. Discrete Math., 14, 3, pp. 423-431, (2001)

[6]

Hoeffding W., Probability Inequalities for Sums of Bounded Random Variables, J. Amer. Statist. Assoc., 58, pp. 13-30, (1963)

← 1 →