相关论文: A short note on the kissing number of the lattice …
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…
Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from $L$ binary code components. If the component codes are linear, then the minimum distance is…
In this note, we present examples showing that several natural ways of constructing lattices from error-correcting codes do not in general yield a correspondence between minimum-weight non-zero codewords and shortest non-zero lattice…
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian distributions around lattice points. Our results include two…
In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…
In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…
We present an extension of the Delsarte linear programming method. For several dimensions it yields improved upper bounds for kissing numbers and for spherical codes. Musin's recent work on kissing numbers in dimensions three and four can…
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128.
We consider a wiretap multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, where agent Alice aims at transmitting a secret message to agent Bob, while leaking no information on it to an eavesdropper agent Eve. We assume…
This paper considers a Gaussian multi-input multi-output (MIMO) multiple access wiretap (MAC-WT) channel, where an eavesdropper (Eve) wants to extract the confidential information of all users. Assuming that both the legitimate receiver and…
A lattice decoder which represents messages explicitly as a mixture of Gaussians functions is given. In order to prevent the number of functions in a mixture from growing as the decoder iterations progress, a method for replacing N Gaussian…
A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known…
This note corrects the paper \cite{ex}, where lattice sequences having exponentially large kissing numbers were constructed. However it was noted in \cite{dif} that the arguments in that paper are not sufficient. Here we correct the…
This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under a peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc…
Following S\"odergren, we consider a collection of random variables on the space $X_n$ of unimodular lattices in dimension $n$: Normalizations of the angles between the $N = N(n)$ shortest vectors in a random unimodular lattice, and the…
Path Integral Monte Carlo simulations have been performed for U(1) lattice gauge theory in (2+1) dimensions on anisotropic lattices. We extractthe static quark potential, the string tension and the low-lying "glueball" spectrum.The…
It is well-known that the densest lattice sphere packings also typically have large kissing numbers. The sphere packing density maximization problem is known to have a solution among well-rounded lattices, of which the integer lattice…
We consider how flat a lattice simplex contained in the hypercube $[0,k]^d$ can be. This question is related to the notion of kissing polytopes: two lattice polytopes contained in the hypercube $[0,k]^d$ are kissing when they are disjoint…
We show that the secrecy function conjecture that states that the maximum of the secrecy function of an $l$-modular lattice occurs at $1/\sqrt{l}$ is false, by proving that the 4-modular lattice $C^(4) = \mathbb{Z} \oplus \sqrt{2}\mathbb{Z}…