相关论文: On the Scalability of Quasi-Complementary Sequence…
Complete complementary codes (CCCs) are highly valuable in the fields of information security, radar and communication. The spectrally null constrained (SNC) problem arises in radar and modern communication systems due to the reservation or…
The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for…
We study the spectrum of loops as a part of a complete network of cosmic strings in flat spacetime. After a long transient regime, characterized by production of small loops at the scale of the initial conditions, it appears that a true…
We propose new constructions for a two-dimensional ($2$D) perfect array, complete complementary code (CCC), and multiple CCCs as an optimal symmetrical $Z$-complementary code set (ZCCS). We propose a method to generate a two-dimensional…
A key problem in making precise perturbative QCD predictions is to set the proper renormalization scale of the running coupling. The extended renormalization group equations, which express the invariance of physical observables under both…
Quadratically constrained quadratic programs (QCQPs) are an expressive family of optimization problems that occur naturally in many applications. It is often of interest to seek out sparse solutions, where many of the entries of the…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
We present a unified theoretical and numerical framework for self-similar multi-shock implosions achieving ultrahigh compression in a uniform solid spherical target. Extending the classical Guderley model to N stacked, spherically…
This study explores the qubit mapping through the integration of Quasi-Orthogonal Space-Time Block Codes (QOSTBCs) with Quaternion Orthogonal Designs (QODs) in quantum error correction (QEC) frameworks. QOSTBCs have gained prominence for…
This work is motivated by the long-standing open problem of designing asymptotically order-optimal aperiodic polyphase sequence sets with respect to the celebrated Welch bound. Attempts were made by Mow over 30 years ago, but a…
Interpreting the representation and generalization powers has been a long-standing issue in the field of machine learning (ML) and artificial intelligence. This work contributes to uncovering the emergence of universal scaling laws in…
The scaling laws guiding modern model training were calibrated for a single regime: data-rich, single-epoch pretraining. The dominant such scaling law form, Chinchilla's $L = E + A/N^\alpha + B/D^\beta$, has three structural limitations…
One of the most important and challenging problems in coding theory is to construct codes with best possible parameters and properties. The class of quasi-cyclic (QC) codes is known to be fertile to produce such codes. Focusing on QC codes…
Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We study a notion of MDS on infinite metric measure spaces,…
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…
Finite-size scaling (FSS) for a critical phase transition ($t=0$) states that within a window of size $|t|\sim L^{-1/\nu}$, the scaling behavior of any observable $Q$ in a system of linear size $L$ asymptotically follows a scaling form as…
In several implementations of Sequential Monte Carlo (SMC) methods it is natural, and important in terms of algorithmic efficiency, to exploit the information of the history of the samples to optimally tune their subsequent propagations. In…
We establish rigorous connections between quantum circuit complexity and approximate quantum error correction (AQEC) capability, two properties of fundamental importance to the physics and practical use of quantum many-body systems,…
Paralleling our recent computationally-intensive work for the case N=4 (quant-ph/0308037), we undertake the task for N=6 of computing to high numerical accuracy, the formulas of Sommers and Zyczkowski (quant-ph/0304041) for the…
We present a scaling investigation of some correlation functions in $\Or(a)$ improved quenched lattice QCD. In particular, as one observable the renormalized PCAC quark mass is considered. Others are constructed such that they become the…