Results 31 to 40 of about 372,286 (56)
NETWORK CODING WITH MODULAR LATTICES
, 2011 Kötter and Kschischang presented in 2008 a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space, a code is a subset of this lattice and the used metric on this alphabet is the
ANDREAS KENDZIORRA, STEFAN E. SCHMIDT
core +1 more source
, 1989 A classical lattice construction of R. P. Dilworth is the gluing of two lattices. A number of recent papers by A. Slavík, A. Day, and J. Ježek investigated a generalization: pasting.
G. Grätzer, E. Fried
core +1 more source
Relations between some dimensions of semimodular lattices [PDF]
, 1984 summary:The aim of this paper is to present relations between Goldie, hollow and Kurosh-Ore dimensions of semimodular lattices. Relations between Goldie and Kurosh-Ore dimensions of modular lattices were studied by Grzeszczuk, Okiński and ...
Puczyłowski, E.R. +4 more
core +1 more source
Capacities and Games on Lattices: A Survey of Result [PDF]
We provide a survey of recent developments about capacities (or fuzzy measures) and ccoperative games in characteristic form, when they are defined on more general structures than the usual power set of the universal set, namely lattices. In a first part,
Michel Grabisch
core
On Concept Lattices of Efficiently Solvable Voting Protocols [PDF]
It is shown that concept lattices can be attached in a natural way to any voting protocol. The concept lattices of some voting protocols that are solvable with respect to some prominnent solution concepts and outcome-efficient are studied: it is proved ...
Stefano Vannucci
core
Condorcet domains and distributive lattices [PDF]
Condorcet domains are sets of linear orders where Condorcet's effect can never occur. Works of Abello, Chameni-Nembua, Fishburn and Galambos and Reiner have allowed a strong understanding of a significant class of Condorcet domains which are distributive
Bernard Monjardet
core
Convex isomorphism of $Q$-lattices [PDF]
, 1993 summary:V. I. Marmazejev introduced in [3] the following concept: two lattices are convex isomorphic if their lattices of all convex sublattices are isomorphic.
Emanovský, Petr
core +1 more source
Jacobi identities, modular lattices, and modular towers [PDF]
, 2003 We give first a simple proof of a generalized Jacobi identity for n-dimensional odd diagonal lattices which specializes to the classical Jacobi identity for the lattice Z2.
Chua, Kok Seng +5 more
core +1 more source
Hjelmslev Planes Derived from Modular Lattices
, 1969 In several papers, W. Klingenberg has elaborated the connections between Hjelmslev planes and a class of rings, called H-rings (4; 5; 6), which are rings of coordinates for the corresponding Hjelmslev planes. Certain homomorphic images of valuation rings
Benno Artmann
core +1 more source
On the mechanical properties of hierarchical lattices
, 2014 Hierarchical lattices are made of finer lattices in successive smaller scales. This paper analytically studies the effect of hierarchy on the stiffness and strength of self-similar and hybrid type lattices, made by combining two distinct variants of ...
Banerjee, Sourish
core +1 more source