✦ LIBER ✦

On Codes with the Identifiable Parent Property

✍ Scribed by Henk D.L Hollmann; Jack H van Lint; Jean-Paul Linnartz; Ludo M.G.M Tolhuizen

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 217 KB
Volume: 82
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2851

No coin nor oath required. For personal study only.

✦ Synopsis

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 # [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 identifiable parent property. Such codes play a role in schemes that protect against piracy of software.

📜 SIMILAR VOLUMES

On the Density of Identifying Codes in t

On the Density of Identifying Codes in the Square Lattice

✍ Iiro Honkala; Antoine Lobstein 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Let G=(V, E) be an undirected graph and C a subset of vertices. If the sets B r (v) 5 C, v ¥ V, are all nonempty and different, where B r (v) denotes the set of all points within distance r from v, we call C an r-identifying code. We give bounds on the best possible density of r-identifying codes in

Optimal Prefix-Free Codes for Unequal Le

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property

✍ Phil Bradford; Mordecai J. Golin; Lawrence L. Larmore; Wojciech Rytter 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 293 KB

In this paper we discuss the problem of finding optimal prefix-free codes for unequal letter costs, a variation of the classical Huffman coding problem. Our problem consists of finding a minimal cost prefix-free code in which the encoding alphabet consists of unequal cost (length) letters, with leng

On digraphs with the odd cycle property

✍ Rachel Manber; Jia-Yu Shao 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 462 KB

We say that a digraph D has the odd cycle property if there exists an edge subset S such that every cycle of D has an odd number of edges from S. We give necessary and sufficient conditions for a digraph to have the odd cycle property. We also consider the analogous problem for graphs.

On finite groups with the cayley isomorp

On finite groups with the cayley isomorphism property

✍ Li, Cai Heng; Praeger, Cheryl E.; Xu, Ming Yao 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T ⊂ G, Cay(G, S) ∼ = Cay(G, T ) implies S α = T for some α ∈ Aut(G), then Cay(G, S) is called a CI-graph of G. For a group G, if all Cayley digraphs of valency m are CI-graphs, then G is said to have the m-DCI property;

On Interpolation Spaces with the Gelfand

On Interpolation Spaces with the Gelfand-Phillips Property

✍ Mieczyslaw Mastylo 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 438 KB 👁 1 views

On the Non - Existence of Perfect Codes

On the Non - Existence of Perfect Codes with Rank Distance

✍ Kefei Chen 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 347 KB

Theory of codes with rank distance was introduced in 1985, which can be applied to crisscross error correction and also used to build some cryptographical schemes. We know that the existence of perfect codes is an interesting topic in coding theory; as a new type of codes, we consider the existence