相关论文: A Direct Construction of Optimal 2D-ZCACS with Fle…
A novel method called mixed variable system Monte Carlo tree search (MVSMCTS) formulation is presented for optimization problems considering various types of variables with single and mixed continuous-discrete system. This method utilizes a…
A new methodology for the synthesis of wide-angle scanning arrays is proposed. It is based on the formulation of the array design problem as a multi-objective one where, for each scan angle, both the radiated power density in the scan…
Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can play a key role for solving coding problems in the…
This research focuses on constructing $q$-ary functions for complete complementary codes (CCCs) with flexible parameters. Most existing work has primarily identified sufficient conditions for $q$-ary functions related to $q$-ary CCCs. To…
Augmented designs are typically used in early-stage breeding programs to compare single replicates of test entries by combining them with replicated check varieties. One or two dimensional incomplete blocking can be incorporated in the…
We study the efficient construction of good polynomial lattice rules, which are special instances of quasi-Monte Carlo (QMC) methods. The integration rules obtained are of particular interest for the approximation of multivariate integrals…
MDS array codes are widely used in storage systems to protect data against erasures. We address the \emph{rebuilding ratio} problem, namely, in the case of erasures, what is the the fraction of the remaining information that needs to be…
We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…
Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time…
Binary constant-weight codes have been extensively studied, due to both their numerous applications and to their theoretical significance. In particular, constant-weight codes have been proposed for error correction in store and forward. In…
This work presents a first comprehensive analysis of the impact of vector coded caching (VCC) in multi-user multiple-input multiple-output (MU-MIMO) systems with multiple receive antennas and variable pathloss -- two key factors that…
We used the mark weighted correlation functions (MCFs), $W(s)$, to study the large scale structure of the Universe. We studied five types of MCFs with the weighting scheme $\rho^\alpha$, where $\rho$ is the local density, and $\alpha$ is…
Z-pinch platforms constitute a promising pathway to fusion energy research. Here, we present a one-dimensional numerical study of the staged Z-pinch (SZP) concept using the FLASH and MACH2 codes. We discuss the verification of the codes…
We study the problem of constructing strong approximate unitary $k$-designs on $D$-dimensional grids (and more generally on Cartesian products of graphs), building on the work of Schuster et al. arXiv:2509.26310 which establishes strong…
The construction of complementary sets (CSs) of sequences with different set size and sequence length become important due to its practical application for OFDM systems. Most of the constructions of CSs, based on generalized Boolean…
Two-dimensional (2D) fully-addressed arrays can conveniently realize three-dimensional (3D) ultrasound imaging while fully controlled such arrays usually demands thousands of independent channels, which is costly. Sparse array technique…
Compared with the perfect complementary sequence sets, quasi-complementary sequence sets (QCSSs) can support more users to work in multicarrier CDMA communications. A near-optimal periodic QCSS is constructed in this paper by using an…
We introduce several new constructions for perfect periodic autocorrelation sequences and arrays over the unit quaternions. This paper uses both mathematical proofs and com- puter experiments to prove the (bounded) array constructions have…
The manuscript describes fast and scalable architectures and associated algorithms for computing convolutions and cross-correlations. The basic idea is to map 2D convolutions and cross-correlations to a collection of 1D convolutions and…
In this paper we introduce a novel MDS array code with lowest density. In contrast to existing codes, this one has no restrictions on the size or the number of erasures it can correct. It is based on a simple matrix construction involving…