English
Related papers

Related papers: Counterexample to the $l$-modular Belfiore-Sol\'e …

200 papers

The point of this note is to prove that the secrecy function attains its maximum at y=1 on all known extremal even unimodular lattices. This is a special case of a conjecture by Belfiore and Sol\'e. Further, we will give a very simple…

Information Theory · Computer Science 2011-04-22 Anne-Maria Ernvall-Hytönen

We show that for every $\ell>1$, there is a counterexample to the $\ell$-modular secrecy function conjecture by Oggier, Sol\'e and Belfiore. These counterexamples all satisfy the modified conjecture by Ernvall-Hyt\"onen and Sethuraman.…

Information Theory · Computer Science 2017-09-12 Esa V. Vesalainen , Anne-Maria Ernvall-Hytönen

In the first part of the paper, we consider the relation between kissing number and the secrecy gain. We show that on an $n=24m+8k$-dimensional even unimodular lattice, if the shortest vector length is $\geq 2m$, then as the number of…

Information Theory · Computer Science 2013-04-01 Anne-Maria Ernvall-Hytönen

The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…

Discrete Mathematics · Computer Science 2016-11-29 Corinna Gottschalk , Britta Peis

We consider lattice coding for the Gaussian wiretap channel, where the challenge is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure…

Information Theory · Computer Science 2021-11-03 Maiara F. Bollauf , Hsuan-Yin Lin , Øyvind Ytrehus

The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the integer lattice. Suppose…

Data Structures and Algorithms · Computer Science 2016-05-11 Tasuku Soma , Yuichi Yoshida

Lattice coding for the Gaussian wiretap channel is considered, where the goal is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure…

Information Theory · Computer Science 2022-02-21 Maiara F. Bollauf , Hsuan-Yin Lin , Øyvind Ytrehus

In a recent paper, the authors introduced a lattice invariant called "Secrecy Gain" which measures the confusion experienced by a passive eavesdropper on the Gaussian Wiretap Channel. We study, here, the behavior of this invariant for…

Information Theory · Computer Science 2010-07-06 Jean-Claude Belfiore , Patrick Sole

It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1 \leq 4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the…

Combinatorics · Mathematics 2017-04-06 Akihiro Higashitani

Consider the discrete maximal function acting on finitely supported functions on the integers, \[ \mathcal{C}_\Lambda f(n) := \sup_{\lambda \in \Lambda} | \sum_{p \in \pm \mathbb{P}} f(n-p) \log |p| \frac{e^{2\pi i \lambda p}}{p} |,\] where…

Classical Analysis and ODEs · Mathematics 2016-05-02 Laura Cladek , Kevin Henriot , Ben Krause , Izabella Laba , Malabika Pramanik

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the…

Data Structures and Algorithms · Computer Science 2022-04-13 Xin Sun , Chenchen Wu , Dachuan Xu , Yang Zhou

In this paper, we prove Deligne's conjecture on the algebraicity of critical values of symmetric power $L$-functions associated to modular forms of weight greater than four. We also prove new cases of Blasius' conjecture on the algebraicity…

Number Theory · Mathematics 2023-07-28 Shih-Yu Chen

Recently, a design criterion depending on a lattice's volume and theta series, called the secrecy gain, was proposed to quantify the secrecy-goodness of the applied lattice code for the Gaussian wiretap channel. To address the secrecy gain…

Information Theory · Computer Science 2024-02-14 Maiara F. Bollauf , Hsuan-Yin Lin , Øyvind Ytrehus

A recent line of work on lattice codes for Gaussian wiretap channels introduced a new lattice invariant called secrecy gain as a code design criterion which captures the confusion that lattice coding produces at an eavesdropper. Following…

Number Theory · Mathematics 2013-04-17 Fuchun Lin , Frédérique Oggier , Patrick Solé

We prove Zimmer's conjecture for co-compact lattices in ${\rm SL}(n, \mathbb C)$: for any co-compact lattice in ${\rm SL}(n, \mathbb C)$, $n \geq 3$, any $\Gamma$-action on a compact manifold $M$ with dimension: (I) less than $2n-2$ if $n…

Dynamical Systems · Mathematics 2018-09-18 Zhiyuan Zhang

Recently, Keith investigated reciprocals of false theta functions and proved some interesting results such as congruences, asymptotic bounds, and combinatorial identities. At the end of his paper, Keith posed a conjecture on congruences…

Number Theory · Mathematics 2025-08-05 Jing Jin , Sijia Wang , Olivia X. M. Yao

We prove Deligne's conjecture for symmetric fifth $L$-functions of elliptic newforms of weight greater than $5$. As a consequence, we establish period relations between motivic periods associated to an elliptic newform and the…

Number Theory · Mathematics 2021-12-28 Shih-Yu Chen

Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…

Discrete Mathematics · Computer Science 2020-07-01 Rishabh Iyer , Jeff Bilmes

We show that on an $n=24m+8k$-dimensional even unimodular lattice, if the shortest vector length is $\geq 2m$, then as the number of vectors of length $2m$ decreases, the secrecy gain increases. We will also prove a similar result on…

Cryptography and Security · Computer Science 2012-09-18 Anne-Maria Ernvall-Hytönen

Let $(L; \sqcap, \sqcup)$ be a finite lattice and let $n$ be a positive integer. A function $f : L^n \to \mathbb{R}$ is said to be submodular if $f(\tup{a} \sqcap \tup{b}) + f(\tup{a} \sqcup \tup{b}) \leq f(\tup{a}) + f(\tup{b})$ for all…

Data Structures and Algorithms · Computer Science 2009-04-22 Fredrik Kuivinen
‹ Prev 1 2 3 10 Next ›