相关论文: n-Channel Asymmetric Multiple-Description Lattice …

The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented…

We study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in…

In this paper, we consider quantized decoding of LDPC codes on the binary symmetric channel. The binary message passing algorithms, while allowing extremely fast hardware implementation, are not very attractive from the perspective of…

Self-synchronization under the presence of additive noise can be achieved by allocating a certain number of bits of each codeword as markers for synchronization. Difference systems of sets are combinatorial designs which specify the…

We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not…

Since the spatially extended periodic parity-time (PT) symmetric potential can possess certain unique properties compared to a single PT cell (with only a pair of coupled gain-loss components), various schemes have been proposed to realize…

The need to estimate a particular quantile of a distribution is an important problem which frequently arises in many computer vision and signal processing applications. For example, our work was motivated by the requirements of many…

We explore the problem of distributed Hypothesis Testing (DHT) against independence, focusing specifically on Binary Symmetric Sources (BSS). Our investigation aims to characterize the optimal quantizer among binary linear codes, with the…

We study efficient distributed algorithms for the fundamental problem of principal component analysis and leading eigenvector computation on the sphere, when the data are randomly distributed among a set of computational nodes. We propose a…

The multiple description (MD) problem has received considerable attention as a model of information transmission over unreliable channels. A general framework for designing efficient multiple description quantization schemes is proposed in…

Distributed optimization finds many applications in machine learning, signal processing, and control systems. In these real-world applications, the constraints of communication networks, particularly limited bandwidth, necessitate…

In this paper, we show that nested lattice codes achieve the capacity of arbitrary channels with or without non-casual state information at the transmitter. We also show that nested lattice codes are optimal for source coding with or…

We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n-dimensional lattice as n tends to infinity. Moreover we interpret the result in terms of eigenvalues and eigenfunctions…

Random binning is an efficient, yet complex, coding technique for the symmetric L-description source coding problem. We propose an alternative approach, that uses the quantized samples of a bandlimited source as "descriptions". By the…

In this thesis, we construct and analyze multiple-description codes based on lattice vector quantization.

We propose an optimisation method for the inverse structural design of self-assembly of anisotropic patchy particles. The anisotropic interaction can be expressed by the spherical harmonics of the surface pattern on a patchy particle, and…

This paper studies the problem of estimation from relative measurements in a graph, in which a vector indexed over the nodes has to be reconstructed from pairwise measurements of differences between its components associated to nodes…

We investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we…

This paper considers lossy source coding of $n$-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion $d$ no greater than $\epsilon$,…

We introduce a parameter space for periodic point sets, given as unions of $m$ translates of point lattices. In it we investigate the behavior of the sphere packing density function and derive sufficient conditions for local optimality.…