Results 21 to 30 of about 6,941 (163)
On the Secrecy Gain of $\ell$-Modular Lattices [PDF]
SIAM Journal on Discrete Mathematics, 2018 We show that for every $\ell>1$, there is a counterexample to the $\ell$-modular secrecy function conjecture by Oggier, Solé and Belfiore. These counterexamples all satisfy the modified conjecture by Ernvall-Hytönen and Sethuraman. Furthermore, we provide a method to prove or disprove the modified conjecture for any given $\ell$-modular lattice ...
Ernvall-Hytönen Anne-Maria +1 more
openaire +2 more sources
Duality web on a 3D Euclidean lattice and manifestation of hidden symmetries
Journal of High Energy Physics, 2019 We generalize our previous lattice construction of the abelian bosonization duality in 2 + 1 dimensions to the entire web of dualities as well as the N f = 2 self-duality, via the lattice implementation of a set of modular transformations in the theory ...
Jun Ho Son, Jing-Yuan Chen, S. Raghu
doaj +1 more source
Left-Modular Elements of Lattices
Journal of Combinatorial Theory, Series A, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shu-Chung Liu, Bruce E. Sagan
openaire +1 more source
Goldie extending elements in modular lattices [PDF]
Mathematica Bohemica, 2017 The concept of a Goldie extending module is generalized to a Goldie extending element in a lattice. An element $a$ of a lattice $L$ with $0$ is said to be a Goldie extending element if and only if for every $b \leq a$ there exists a direct summand $c$ of
Shriram K. Nimbhorkar, Rupal C. Shroff
doaj +1 more source
Segment LLL Reduction of Lattice Bases Using Modular Arithmetic
Algorithms, 2010 The algorithm of Lenstra, Lenstra, and Lovász (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of O(n) using modular arithmetic.
Sanjay Mehrotra, Zhifeng Li
doaj +1 more source
Fuzzy Distributive Pairs in Fuzzy Lattices
Discussiones Mathematicae - General Algebra and Applications, 2022 We generalize the concept of a fuzzy distributive lattice by introducing the concepts of a fuzzy join-distributive pair and a fuzzy join-semidistributive pair in a fuzzy lattice.
Wasadikar Meenakshi, Khubchandani Payal
doaj +1 more source
Categorical Dualities for Some Two Categories of Lattices: An Extended Abstract
Bulletin of the Section of Logic, 2022 The categorical dualities presented are: (first) for the category of bi-algebraic lattices that belong to the variety generated by the smallest non-modular lattice with complete (0,1)-lattice homomorphisms as morphisms, and (second) for the category of ...
Wiesław Dziobiak, Marina Schwidefsky
doaj +1 more source
NETWORK CODING WITH MODULAR LATTICES [PDF]
Journal of Algebra and Its Applications, 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 map d : (U, V) ↦ dim (U+V)- dim (U∩V).
Andreas Kendziorra, Stefan E. Schmidt
openaire +2 more sources
On some classes of sublattices of the subgroup lattice
Журнал Белорусского государственного университета: Математика, информатика, 2019 In this paper G always denotes a group. If K and H are subgroups of G, where K is a normal subgroup of H, then the factor group of H by K is called a section of G.
Alexander N. Skiba
doaj +1 more source
Memory‐constrained implementation of lattice‐based encryption scheme on standard Java Card platform
IET Information Security, 2021 The lattice‐based encryption scheme has high efficiency and reliability, and it can be run on small devices with limited memory capacity and computational resources such as sensor nodes or smart cards.
Ye Yuan +4 more
doaj +1 more source