scholarly journals Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices

2012 ◽  
Author(s):  
Fuchun Lin ◽  
Frederique Oggier
Keyword(s):  
Modular Lattices ◽  
Wiretap Codes

scholarly journals Seven-modular lattices and a septic base Jacobi identity

2003 ◽  
Vol 99 (2) ◽  
pp. 361-372 ◽  
Author(s):  
Heng Huat Chan ◽  
Kok Seng Chua ◽  
Patrick Solé
Keyword(s):  
Jacobi Identity ◽  
Modular Lattices

Matchings and Radon transforms in lattices II. Concordant sets

1987 ◽  
Vol 101 (2) ◽  
pp. 221-231 ◽  
Author(s):  
Joseph P. S. Kung
Keyword(s):  
Incidence Matrix ◽  
Finite Lattice ◽  
Möbius Function ◽  
Radon Transforms ◽  
Modular Lattices ◽  
Covering Theorem ◽  
Mobius Function ◽  
Finite Lattices ◽  
Semimodular Lattices

AbstractLet and ℳ be subsets of a finite lattice L. is said to be concordant with ℳ if, for every element x in L, either x is in ℳ or there exists an element x+ such that (CS1) the Möbius function μ(x, x+) ≠ 0 and (CS2) for every element j in , x ∨ j ≠ x+. We prove that if is concordant with ℳ, then the incidence matrix I(ℳ | ) has maximum possible rank ||, and hence there exists an injection σ: → ℳ such that σ(j) ≥ j for all j in . Using this, we derive several rank and covering inequalities in finite lattices. Among the results are generalizations of the Dowling-Wilson inequalities and Dilworth's covering theorem to semimodular lattices, and a refinement of Dilworth's covering theorem for modular lattices.

scholarly journals Baer-Galois connections and applications

2014 ◽  
Vol 30 (2) ◽  
pp. 225-229
Author(s):  
GABRIELA OLTEANU ◽  
Keyword(s):  
Modular Lattices ◽  
Galois Connections ◽  
Baer Modules

We define Baer-Galois connections between bounded modular lattices. We relate them to lifting lattices and we show that they unify the theories of (relatively) Baer and dual Baer modules.

Undirected Graphs Realizable as Graphs of Modular Lattices

1965 ◽  
Vol 17 ◽  
pp. 923-932 ◽  
Author(s):  
Laurence R. Alvarez
Keyword(s):  
Distributive Lattice ◽  
Partial Order ◽  
Directed Graph ◽  
Undirected Graph ◽  
Single Edge ◽  
Undirected Graphs ◽  
Modular Lattices

If (L, ≥) is a lattice or partial order we may think of its Hesse diagram as a directed graph, G, containing the single edge E(c, d) if and only if c covers d in (L, ≥). This graph we shall call the graph of (L, ≥). Strictly speaking it is the basis graph of (L, ≥) with the loops at each vertex removed; see (3, p. 170).We shall say that an undirected graph Gu can be realized as the graph of a (modular) (distributive) lattice if and only if there is some (modular) (distributive) lattice whose graph has Gu as its associated undirected graph.

Sign in / Sign up

Export Citation Format

Share Document