✦ LIBER ✦

Intersecting codes and partially identifying codes

✍ Scribed by G. Cohen; S. Encheva; S. Litsyn

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 508 KB
Volume: 6
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00172-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear intersecting codes

✍ Gérard Cohen; Abraham Lempel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 358 KB

We study pairs of binary linear codes Cl(n, nR1), C2(n, nR 2) with the property that for any nonzero cl c C~ and c2~ C 2, there are coordinates in which both c, and c 2 are nonzero.

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

Covering arrays and intersecting codes

✍ N. J. A. Sloane 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

A t-covering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved by Rkn

Erratum to “Intersecting codes and separ

Erratum to “Intersecting codes and separating codes”: [Discrete Applied Mathematics 128 (2003) 75–83]

✍ G. Cohen; S. Encheva; S. Litsyn; H.G. Schaathun 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 74 KB

On Identifying Codes in Binary Hamming S

On Identifying Codes in Binary Hamming Spaces

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

A binary code C f0; 1g n is called r-identifying, if the sets B r ðxÞ \ C; where B r ðxÞ is the set of all vectors within the Hamming distance r from x; are all nonempty and no two are the same. Denote by M r ðnÞ the minimum possible cardinality of a binary r-identifying code in f0; 1g n : We prove

Linkage and Codes on Complete Intersecti

Linkage and Codes on Complete Intersections

✍ Johan P. Hansen 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 138 KB