Related papers: Multiple-Description Lattice Vector Quantization
The problem of constructing lattices such that their quantization noise approaches a desired distribution is studied. It is shown that asymptotically is the dimension, lattice quantization noise can approach a broad family of distribution…
It is known that multiple zeta values can be written in terms of certain iterated log-sine integrals. Conversely, we evaluate iterated log-sine integrals in terms of multiple polylogarithms and multiple zeta values in this paper. We also…
In this survey article for the Encyclopedia of Mathematical Physics, 2nd Edition, I give an introduction to quantum character varieties and quantum character stacks, with an emphasis on the unification between four different approaches to…
We begin with a description of recent numerical and analytical results that are closely related to the results of this paper.
I briefly introduce the methods by which lattice QCD predictions for RHIC are obtained. Next I deal with lattice determinations of strangeness production and event-to-event fluctuations of conserved quantities. I also present a new…
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
The simulation code has been developed to investigate possible electron multi- pacting in the 3D RF cavities using preliminary calculated field components. The code provides different options of numerical study of the electron multi-…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
Encoding and indexing of lattice codes is generalized from self-similar lattice codes to a broader class of lattices. If coding lattice $\Lambda_{\textrm{c}}$ and shaping lattice $\Lambda_{\textrm{s}}$ satisfy $\Lambda_{\textrm{s}}…
We present a general framework for studying the multilevel structure of lattice network coding (LNC), which serves as the theoretical fundamental for solving the ring-based LNC problem in practice, with greatly reduced decoding complexity.…
This paper primarily studies monomial ideals by their associated lcm-lattices. It first introduces notions of weak coordinatizations of finite atomic lattices which have weaker hypotheses than coordinatizations and shows the…
The construction of deletion codes for the Levenshtein metric is reduced to the construction of codes over the integers for the Manhattan metric by run length coding. The latter codes are constructed by expurgation of translates of…
q-ary lattices can be obtained from q-ary codes using the so-called Construction A. We investigate these lattices in the Lee metric and show how their decoding process can be related to the associated codes. For prime q we derive a Lee…
We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…
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…
The aim of this paper is to investigate different types of multi-integrals of finite variation and to obtain decomposition results.
The multislice method, which simulates the propagation of the incident electron wavefunction through a crystal, is a well-established method for analyzing the multiple scattering effects that an electron beam may undergo. The inclusion of…
In this work, we formulate \textbf{T}ext \textbf{C}lassification as a \textbf{M}atching problem between the text and the labels, and propose a simple yet effective framework named TCM. Compared with previous text classification approaches,…
The coding problem considered in this work is to construct a linear code $\mathcal{C}$ of given length $n$ and dimension $k<n$ such that a given binary vector $\mathbf{r} \in \mathbb{F}^{n}$ is contained in the code. We study a recent…