On codes with the identifiable parent property

被引：130

作者：

Hollmann, HDL ^{[1
]}

van Lint, JH ^{[1
]}

Linnartz, JP ^{[1
]}

Tolhuizen, LMGM ^{[1
]}

机构：

[1] Philips Res Labs, NL-5656 AA Eindhoven, Netherlands

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 1998年 / 82卷 / 02期

关键词：

D O I：

10.1006/jcta.1997.2851

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

If C is a q-ary code of length n and a and b are two codewords, then c is called a descendant of a and b if c(i) is an element of {a(i), b(i)} for i = 1, ..., n. We are interested in codes C with the property that, given any descendant c, one can always identify at least one of the "parent" codewords in C. We study bounds on F(n, q), the maximal cardinality of a code C with this property, which we call the indentifiable parent property. Such codes play a role in schemes that protect against piracy of software. (C) 1998 Academic Press.

引用

页码：121 / 133

页数：13

共 7 条

[1]

[Anonymous], C MATH SOC J BOLYAI

[2] NEW BOUNDS FOR PERFECT HASHING VIA INFORMATION-THEORY [J].