Related papers: Multiple-Description Lattice Vector Quantization
LatKMI Collaboration discusses the topological insights in many-flavor QCD on the lattice. We explore walking/conformal/confining phase in $N_\mathrm{f}$ = 4, 8 and 12 (in particular $N_\mathrm{f}$ = 8) lattice QCD via the topological…
A higher dimensional lattice space can be decomposed into a number of four-dimensional lattices called as layers. The higher dimensional gauge theory on the lattice can be interpreted as four-dimensional gauge theories on the multi-layer…
Automatically describing video content with text description is challenging but important task, which has been attracting a lot of attention in computer vision community. Previous works mainly strive for the accuracy of the generated…
The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a…
We study the continuous extension of discrete shift translations on one-dimensional quantum lattice systems.
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
Persistent homology has undergone significant development in recent years. However, one outstanding challenge is to build a coherent statistical inference procedure on persistent diagrams. In this paper, we first present a new lattice path…
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…
Code Large Language Models (Code LLMs) have demonstrated outstanding performance in code-related tasks. Several instruction tuning approaches have been proposed to boost the code generation performance of pre-trained Code LLMs. In this…
Theoretical and computational advances in lattice calculations are reviewed, with focus on examples relevant to the unitarity triangle of the CKM matrix. Recent progress in semi-leptonic form factors for B -> pi l nu and B -> D* l nu, as…
Optimization of applications for supercomputers of the highest performance class requires parallelization at multiple levels using different techniques. In this contribution we focus on parallelization of particle physics simulations…
Large language models can consult information that fixed static analyzers cannot, such as documentation, current security advisories, version-specific metadata, and informal API contracts. This makes LLMs a compelling option for program…
In this paper, we propose a deep multiple description coding framework, whose quantizers are adaptively learned via the minimization of multiple description compressive loss. Firstly, our framework is built upon auto-encoder networks, which…
In this note we introduce multi-interpolated multiple zeta values. We provide a basic decomposition of these objects involving ordered partitions. We also obtain identities for special instances of multi-interpolated multiple zeta values…
Recent trends in lattice QCD calculations and latest results are reviewed, with particular emphasis on multiquark-states and the nucleon structure.
As AI-based code generation becomes widespread, researchers are investigating the calibration of code LLMs - ensuring their confidence scores faithfully represent the true likelihood of code correctness. To do so, we investigate…
A rewriting code construction for flash memories based upon lattices is described. The values stored in flash cells correspond to lattice points. This construction encodes information to lattice points in such a way that data can be written…
We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
We provide two analytical tools to model the inactivation decoding process of LT codes. First, a model is presented which derives the expected number of inactivations occurring in the decoding process of an LT code. This analysis is then…