✦ LIBER ✦

On the size of identifying codes in binary hypercubes

✍ Scribed by Svante Janson; Tero Laihonen

Book ID: 108167269
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 195 KB
Volume: 116
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2009.02.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the size of identifying codes in tria

On the size of identifying codes in triangle-free graphs

✍ Florent Foucaud; Ralf Klasing; Adrian Kosowski; André Raspaud 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 308 KB

On shifting sets in the binary hypercube

✍ Yu. L. Vasil’ev; S. V. Avgustinovich; D. S. Krotov 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 520 KB

Two families of optimal identifying code

Two families of optimal identifying codes in binary Hamming spaces

✍ Ranto, S.M.; Honkala, I.S.; Laihonen, T.K. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 269 KB

Classification of the Hamiltonian Cycles

Classification of the Hamiltonian Cycles in Binary Hypercubes

✍ P.P. Parkhomenko 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 157 KB

Asymptotic improvement of the Gilbert-Va

Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes

✍ Tao Jiang; Vardy, A. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 339 KB