相关论文: New Optimal $Z$-Complementary Code Sets from Matri…
We exam the pairs of neutrino mixing matrix and suggest pairs that can be used in the construction of new mixing patterns, with "pair" denoting the equality of the modulus of a pair of matrix elements. The results show that the tri-maximal…
The NP-hard problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well as other active sensing and communication applications. To tackle this problem (which we call unimodular…
We introduce surface ZZZY codes, a novel family of quantum error-correcting codes designed for asymmetric channels. Derived from standard surface codes through tailored modification of generators, ZZZY codes can be decoded by the minimum…
In order to correct the pair-errors generated during the transmission of modern high-density data storage that the outputs of the channels consist of overlapping pairs of symbols, a new coding scheme named symbol-pair code is proposed. The…
Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming methods. By focusing the discussion to the block structure of…
Tensor Processing Units (TPUs) are specialized hardware accelerators for deep learning developed by Google. This paper aims to explore TPUs in cloud and edge computing focusing on its applications in AI. We provide an overview of TPUs,…
This work deals with the optimization of computer programs targeting Graphics Processing Units (GPUs). The goal is to lift, from programmers to optimizing compilers, the heavy burden of determining program details that are dependent on the…
Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the corresponding code length is limited to the power of two. In this paper, we establish a…
This paper introduces a novel class of code sets, called "symmetrical Z-complementary code sets (SZCCSs)" , whose aperiodic auto- and cross- correlation sums exhibit zero-correlation zones (ZCZs) at both the front-end and tail-end of the…
Two matrices $A$ and $B$ are called unitary (resp. orthogonal) equivalent if $AU=VB$ for two unitary (resp. orthogonal) matrices $U$ and $V$. Using trace identities, criteria are given for simultaneous unitary, orthogonal or complex…
The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new…
A pair of sequences is called a Z-complementary pair (ZCP) if it has zero aperiodic autocorrelation sums at each of the non-zero time-shifts within {a} certain region, called the zero correlation zone (ZCZ). ZCPs are categorised into two…
A design framework to implement non-unitary input-output operations to a practical unitary photonic integrated circuit is described. This is achieved by utilising the cosine-sine decomposition to recover the unitarity of the original…
The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to $10^{-15}$. Such…
Large-scale programmable photonic circuits are opening up new possibilities for information processing providing fast and energy-efficient means for matrix-vector multiplication. Here, we introduce a novel architecture of photonic circuits…
In this article, we establish a class of new accelerated modulus-based iteration methods for solving the linear complementarity problem. When the system matrix is an $H_+$-matrix, we present appropriate criteria for the convergence…
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…
The development of large-scale, programmable photonic circuits capable of performing generic matrix-vector multiplication is essential for both classical and quantum information processing. However, this goal is hindered by high losses,…
When a nontrivial measure $\mu$ on the unit circle satisfies the symmetry $d\mu(e^{i(2\pi-\theta)}) = - d\mu(e^{i\theta})$ then the associated OPUC, say $S_n$, are all real. In this case, Delsarte and Genin, in 1986, have shown that the two…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…