相关论文: A Generic Complementary Sequence Construction and …
According to the well-known loop shaping method for the design of controllers, the performance of the controllers in terms of step response, steady-state disturbance rejection and noise attenuation and robustness can be improved by…
Compressive sensing (CS), aiming to reconstruct an image/signal from a small set of random measurements has attracted considerable attentions in recent years. Due to the high dimensionality of images, previous CS methods mainly work on…
We generalize the embedding formalism for conformal field theories to the case of general operators with mixed symmetry. The index-free notation encoding symmetric tensors as polynomials in an auxiliary polarization vector is extended to…
Neural speech codecs have gained great attention for their outstanding reconstruction with discrete token representations. It is a crucial component in generative tasks such as speech coding and large language models (LLM). However, most…
We introduce a novel visual tokenization framework that embeds a provable PCA-like structure into the latent token space. While existing visual tokenizers primarily optimize for reconstruction fidelity, they often neglect the structural…
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…
We present a novel robust framework for systematically constructing $D$-dimensional four-point higher-derivative contact amplitudes. Our modular block ("LEGO"-like) approach builds amplitudes directly from manifestly gauge-invariant…
For LDPC codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario,…
Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…
New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes $\left\{\genfrac{}{}{0pt}{}{m}{r}\right\} $ of length $2^{m}$ and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose code…
The Compressive Sensing (CS) as a novel acquisition approach that finds its usage in image processing. The hypothesis like this one assures signal recovery with high quality from decreased number of samples compared with the number required…
We present a construction for the composition of subsequential transducers (representing conditional probabilistic models) with subsequential failure transducers (representing probabilistic models). Under certain conditions, satisfied by…
A mixed basis approach based on density functional theory is employed for low dimensional systems. The basis functions are taken to be plane waves for the periodic direction multiplied by B-spline polynomials in the non-periodic direction.…
In this work, merging ideas from compatible discretisations and polyhedral methods, we construct novel fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra. The spaces and operators that appear in these…
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows that the generator matrices of Reed-Solomon codes can attain every possible configuration of zeros for an MDS code. The recently emerging…
We proposed a novel code called cyclic shift (CS) code to overcome the drawbacks exists in traditional Spectral Amplitude Coding- Optical Code Division Multiple Access (SAC-OCDMA) codes that have been presented in the past few years. The…
An extended range of energy stable flux reconstruction schemes, developed using a summation-by-parts approach, is presented on quadrilateral elements for various sets of polynomial bases. For the maximal order bases, a new set of correction…
We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…
Analogously to de Bruijn sequences, Orientable sequences have application in automatic position-location applications and, until recently, studies of these sequences focused on the binary case. In recent work by Alhakim et al., recursive…
We construct a faithful representation of the semiring of all order-preserving decreasing transformations of a chain with $n+1$ elements by Boolean upper triangular $n\times n$-matrices.