𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized hashing and parent-identifying codes

✍ Scribed by Noga Alon; Gérard Cohen; Michael Krivelevich; Simon Litsyn

Book ID
108167101
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
147 KB
Volume
104
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parent-Identifying Codes
Parent-Identifying Codes
✍ Noga Alon; Eldar Fischer; Mario Szegedy 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 112 KB

For a set C of words of length 4 over an alphabet of size n, and for a, b # C, let D(a, b) be the set of all descendants of a and b, that is, all words x of length 4 where x i # [a i , b i ] for all 1 i 4. The code C satisfies the Identifiable Parent Property if for any descendant of two code-words

On Codes with the Identifiable Parent Pr
On Codes with the Identifiable Parent Property
✍ Henk D.L Hollmann; Jack H van Lint; Jean-Paul Linnartz; Ludo M.G.M Tolhuizen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 217 KB

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