𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The meet operation in the lattice of codes

✍ Scribed by Véronique Bruyère; Denis Derencourt; Michel Latteux

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
795 KB
Volume
191
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

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, Y for which the meet is a maximal code. We also show that any rational (maximal or not) code is the meet of two rational maximal codes.

📜 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

Z6-Code Constructions of the Leech Latti
Z6-Code Constructions of the Leech Lattice and the Niemeier Lattices
✍ Masaaki Harada; Masaaki Kitazume 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 95 KB

In this paper, we construct many new extremal Type II Z 6 -codes of length 24, and consequently we show that there is at least one extremal Type II Z 6 -code C of length 24 such that the binary and ternary reductions of C are B and T , respectively, for every binary Type II code B and every extremal

Divisibility of Codes Meeting the Griesm
Divisibility of Codes Meeting the Griesmer Bound
✍ Harold N. Ward 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We prove that if a linear code over GF( p), p a prime, meets the Griesmer bound, then if p e divides the minimum weight, p e divides all word weights. We present some illustrative applications of this result.

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