Related papers: A Radix-M Construction for Complementary Sets

This thesis develops the categorical proof theory for the non-compact multiplicative dagger linear logic, and investigates its applications to Categorical Quantum Mechanics (CQM). The existing frameworks of CQM are categorical proof…

This paper focuses on the embeddability of hypercubes in an important class of Cayley graphs, known as augmented cubes. An $n$-dimensional augmented cube $AQ_n$ is constructed by augmenting the $n$-dimensional hypercube $Q_n$ with…

Renormalization Group (RG) and optimized Pade-approximant methods are used to estimate the three-loop perturbative contributions to the inclusive semileptonic b \to u and b \to c decay rates. It is noted that the \bar{MS} scheme works…

Let $M$ be a finitely generated module of dimension $d$ over a Noetherian local ring $(R,\m)$ and $\q $ the parameter ideal generated by a system of parameters $\x = (x_1,..., x_d)$ of $M$. For each positive integer $n$, set…

A construction of Partial Maximum Distance Separable (PMDS) and Sector-Disk (SD) codes extending RAID 5 with two extra parities is given, solving an open problem. Previous constructions relied on computer searches, while our constructions…

In the paper we first construct a new cotorsion pair, in the category of chain complexes, from two given cotorsion pairs in the category of modules, and then we consider completeness of such pairs under certain conditions.

Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…

Recently there has been interest in the construction of small parity check sets for iterative decoding of the Hamming code with the property that each uncorrectable (or stopping) set of size three is the support of a codeword and hence…

Let $M$ be an imaginary quadratic field with the ring of integers $\mathbb{Z}_{M}$ and let $\xi$ be a root of polynomial $$f\left( x\right) =x^{4}-2cx^{3}+2x^{2}+2cx+1,$$ where $c\in\mathbb{Z}_{M},$ $c\notin\left\{ 0,\pm2\right\}$. We…

A principal concern in the optimisation of parametrised quantum circuits is the presence of barren plateaus, which present fundamental challenges to the scalability of applications, such as variational algorithms and quantum machine…

In this paper an approach to generate multi-dimensionally consistent $N$-component systems is proposed. The approach starts from scalar multi-dimensionally consistent quadrilateral systems and makes use of the cyclic group. The obtained…

Let $R$ be a local ring and $M,N$ be finitely generated $R$-modules. The complexity of $(M,N)$, denoted by $\cxx RMN$, measures the polynomial growth rate of the number of generators of the modules $\Ext nRMN$. In this paper we study…

We generalize the construction of Doppler-tolerant Golay complementary waveforms by Pezeshki-Calderbank-Moran-Howard to complementary code sets having more than two codes. This is accomplished by exploiting number-theoretic results…

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…

Design methods for paraunitary matrices from complete orthogonal sets of idempotents and related matrix structures are presented. These include techniques for designing non-separable multidimensional paraunitary matrices. Properties of the…

Polar codes are a new family of error correction codes for which efficient hardware architectures have to be defined for the encoder and the decoder. Polar codes are decoded using the successive cancellation decoding algorithm that includes…

The matrix completion problem provides a unifying lens through which many fundamental problems in coding theory can be viewed. In this paper, we investigate Locally Recoverable Codes (LRCs) with Maximal Recoverability (MR) and Maximum…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

An important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths $n$. In this paper, we address this question for specific values of $n$. First, we investigate the existence of…

CMS experiment constructed the fourth Resistive Plate Chamber (RPC) trigger station composed of 144 RPCs to enhance the high momentum muon trigger efficiency at both endcap regions. All new CMS endcap RPC gaps are produced in accordance…