THE MEET OPERATION IN THE LATTICE OF CODES

Authors
BRUYERE V DERENCOURT D LATTEUX M
Citation
V. Bruyere et al., THE MEET OPERATION IN THE LATTICE OF CODES, Theoretical computer science, 191(1-2), 1998, pp. 117-129
Citations number
11
Categorie Soggetti
Computer Science Theory & Methods","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
191
Issue
1-2
Year of publication
1998
Pages
117 - 129
Database
ISI
SICI code
0304-3975(1998)191:1-2<117:TMOITL>2.0.ZU;2-Q
Abstract
We study properties of the meet of two rational codes X and Y, defined as the base of the free monoid X boolean AND Y*. We first give sever al 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 tw o rational maximal codes.