✦ LIBER ✦

Codes for Identification in the King Lattice

✍ Scribed by Iiro Honkala; Tero Laihonen

Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 324 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-003-0531-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimalt-Edge-Robustr-Identifying Codes

Optimalt-Edge-Robustr-Identifying Codes in the King Lattice

✍ Tero Laihonen 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 190 KB

The minimum density of an identifying co

The minimum density of an identifying code in the king lattice

✍ Irène Charon; Iiro Honkala; Olivier Hudry; Antoine Lobstein 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Consider a connected undirected graph G =(V; E) and a subset of vertices C. If for all vertices v ∈ V , the sets Br(v) ∩ C are all nonempty and di erent, where Br(v) denotes the set of all points within distance r from v, then we call C an r-identifying code. For all r, we give the exact value of th

The meet operation in the lattice of cod

The meet operation in the lattice of codes

✍ Véronique Bruyère; Denis Derencourt; Michel Latteux 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 795 KB

We study properties of the meet of two rational codes X and Y, defined as the base of the free monoid X\* n Y\*. We first give several examples of rational maximal codes X and Y such that their meet is no longer a maximal code. We give a combinatorial characterization of the rational maximal codes X

Z4-Code Constructions for the Niemeier L

Z4-Code Constructions for the Niemeier Lattices and their Embeddings in the Leech Lattice

✍ Masaaki Harada; Masaaki Kitazume 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 121 KB

In this note, we give Z 4 -code constructions of the Niemeier lattices, showing their embedding in the Leech lattice. These yield an alternative proof of a recent result by Dong et al. [5].

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

Coding-based schemes for fault identific

Coding-based schemes for fault identification in communication networks

✍ Chi-Chun Lo; Shing-Hong Chen; Bon-Yeh Lin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 2 views

This paper proposes two event correlation schemes for fault identification in communication networks. The causality graph model is used to describe the cause-and-effect relationships between network events.