Related papers: An Approximation of Theta Functions with Applicati…
The theta series of a lattice is a power series that characterizes the number of lattice vectors at certain norms. It is closely related to a critical quantity widely used in physical layer security and cryptography, known as the flatness…
Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this…
In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which…
We show that the correct decoding probability of an eavesdropper and error probability of a legitimate receiver in a Rayleigh fading wiretap channel with lattice coset coding are both upper bounded by the theta function in the $\ell^1$-norm…
The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From these bounds, it is explicit that both the information leakage…
We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor which characterizes the convergence of the…
Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…
Lattices are deceptively simple mathematical structures that have become indispensable for code design for physical layer communications. While lattice-related problems are interesting in their own right, the usefulness of these discrete…
We study the minimality properties of a new type of "soft" theta functions. For a lattice $L\subset \mathbb{R}^d$, a $L$-periodic distribution of mass $\mu_L$ and an other mass $\nu_z$ centred at $z\in \mathbb{R}^d$, we define, for all…
Mimicking the idea of the generalized Hamming weight of linear codes, we introduce a new lattice invariant, the generalized theta series. Applications range from identifying stable lattices to the lattice isomorphism problem. Moreover, we…
In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
We have made substantial advances in elucidating the properties of the susceptibility of the square lattice Ising model. We discuss its analyticity properties, certain closed form expressions for subsets of the coefficients, and give an…
Despite its reduced complexity, lattice reduction-aided decoding exhibits a widening gap to maximum-likelihood (ML) performance as the dimension increases. To improve its performance, this paper presents randomized lattice decoding based on…
LDPC lattices were the first family of lattices that equipped with iterative decoding algorithms under which they perform very well in high dimensions. In this paper, we introduce quasi cyclic low density parity check (QC-LDPC) lattices as…
Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such as sum-product or min-sum algorithms in which the weight of…
The surface code is a promising platform for a quantum memory, but its threshold under coherent errors remains incompletely understood. We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit…
We show that a lattice formulation of density-functional theory (DFT), guided by renormalization-group concepts, can be used to obtain numerical predictions of energy gaps, spin-density profiles, critical exponents, sound velocities,…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
We consider a deformation $E_{L,\Lambda}^{(m)}(it)$ of the Dedekind eta function depending on two $d$-dimensional simple lattices $(L,\Lambda)$ and two parameters $(m,t)\in (0,\infty)$, initially proposed by Terry Gannon. We show that the…