相关论文: Ulam Sphere Size Analysis for Permutation and Mult…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
We propose a new Write-Once-Memory (WOM) coding scheme based on source polarization. By applying a source polarization transformation on the to-be-determined codeword, the proposed WOM coding scheme encodes information into the bits in the…
Data is compressed by reducing its redundancy, but this also makes the data less reliable, more prone to errors. In this paper a novel approach of image compression based on a new method that has been created for image compression which is…
Parametrized measures (or Young measures) enable to reformulate non-convex variational problems as convex problems at the cost of enlarging the search space from space of functions to space of measures. To benefit from such machinery, we…
Determining the optimal number and identity of structural clusters from an ensemble of molecular configurations continues to be a challenge. Recent structural clustering methods have focused on the use of internal coordinates due to the…
We study perfect codes in the sum-rank metric, a generalization of both the Hamming and rank metrics relevant in multishot network coding and space-time coding. A perfect code attains equality in the sphere-packing bound, corresponding to a…
We introduce a single-number metric, quantum volume, that can be measured using a concrete protocol on near-term quantum computers of modest size ($n\lesssim 50$), and measure it on several state-of-the-art transmon devices, finding values…
Clues to the shape of our Universe can be found by searching the CMB for matching circles of temperature patterns. A full sky search of the CMB, mapped extremely accurately by NASA's WMAP satellite, returned no detection of such matching…
An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are important because they admit analytical designs and simple, practical hardware implementation. The spread factor of an…
Large Language Models (LLMs) are increasingly deployed on edge devices with Neural Processing Units (NPUs), yet the decode phase remains memory-intensive, limiting performance. Processing-in-Memory (PIM) offers a promising solution, but…
Large language models (LLMs) have transformed artificial intelligence, yet classical architectures impose a fundamental constraint: every trainable parameter demands classical memory that scales unfavourably with model size. Quantum…
In this paper, we propose two methods of calculating theoretically maximal metamer mismatch volumes. Unlike prior art techniques, our methods do not make any assumptions on the shape of spectra on the boundary of the mismatch volumes. Both…
Modular quantum computing architectures require error correction schemes that remain effective in the presense of noisy inter-processor operations. We introduce a distributed quantum error correction framework based on approximate codes to…
This paper presents a low-complexity near-maximum-likelihood-detection (near-MLD) algorithm called one-bit-sphere-decoding for an uplink massive multiple-input multiple-output (MIMO) system with one-bit analog-to-digital converters (ADCs).…
A new lower bound on the average reconstruction error variance of multidimensional sampling and reconstruction is presented. It applies to sampling on arbitrary lattices in arbitrary dimensions, assuming a stochastic process with constant,…
The recovery of training data from generative models ("model inversion") has been extensively studied for diffusion models in the data domain as a memorization/overfitting phenomenon. Latent diffusion models (LDMs), which operate on the…
A closed-form formula for the nonlinear interference estimation of arbitrary modulation formats in ultra-wideband transmission systems is presented. Enabled by the proposed approach, the formula is applied to the entire S+C+L band (20 THz)…
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…
The ability to store multiple optical modes in a quantum memory allows for increased efficiency of quantum communication and computation. Here we compute the multimode capacity of a variety of quantum memory protocols based on light storage…
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of…