Related papers: Constructions of Polyphase Golay Complementary Arr…
A family of two-unitary complex Hadamard matrices (CHM) stemming from a particular matrix, of size $36$ is constructed. Every matrix in this orbit remains unitary after operations of partial transpose and reshuffling which makes it a…
We present a method to construct induced representations of quantum algebras having the structure of bicrossproduct. We apply this procedure to some quantum kinematical algebras in (1+1)--dimensions with this kind of structure: null-plane…
Let $G$ be a finite group, and $\alpha$ a nontrivial character of $G$. The McKay graph $\mathcal{M}(G,\alpha)$ has the irreducible characters of $G$ as vertices, with an edge from $\chi_1$ to $\chi_2$ if $\chi_2$ is a constituent of…
A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final…
Based on the ASIC layout level simulation of 7 types of adder structures each of four different sizes, i.e. a total of 28 adders, we propose expressions for the width of each of the three regions of the final Carry Propagate Adder (CPA) to…
Stringy canonical forms are a class of integrals that provide $\alpha'$-deformations of the canonical form of any polytopes. For generalized associahedra of finite-type cluster algebra, there exist completely rigid stringy integrals, whose…
We have developed a FX-architecture digital spectro-correlator, Atacama Compact Array Correlator for the Atacama Large Millimeter/submillimeter Array. The ACA Correlator processes four pairs of dual polarization signals, whose bandwidth is…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
This article is devoted to the investigation of semidirect products of groups of loops and groups of diffeomorphisms of finite and infinte dimensional real, complex and quaternion manifolds. Necessary statements about quaternion manifolds…
In this note we study several conditions to be imposed on a mirror symmetry candidate to the generic multi-quasihomogeneous Calabi-Yau variety defined in the product of the quasihomogeneous projective spaces. We propose several properties…
Gopala-Hemachandra codes are a variation of the Fibonacci universal code and have applications in cryptography and data compression. We show that $GH_{a}(n)$ codes always exist for $a=-2,-3$ and $-4$ for any integer $n \geq 1$ and hence are…
A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes…
This work focuses on studying the half-duplex (HD) relaying in the Multiple Access Relay Channel (MARC) and the Compound Multiple Access Channel with a Relay (cMACr). A generalized Quantize-and-Forward (GQF) has been proposed to establish…
Geometrically characterized (GC) sets were introduced by Chung-Yao in their work on polynomial interpolation in R^d. Conjectures on the structure of GC sets have been proposed by Gasca-Maeztu for the planar case, and in higher dimension by…
We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complementary sequences obtained from the arrays by projection. We…
We identify an equality between two objects arising from different contexts of mathematical physics: Kahane's Gaussian Multiplicative Chaos ($GMC^\gamma$) on the circle, and the Circular Beta Ensemble $(C\beta E)$ from Random Matrix Theory.…
Let n be either 2, or an odd integer greater than 1, and fix a prime p > 2(n + 1). Under standard "adequate image" assumptions, we show that the set of components of n-dimensional p-adic potentially semistable local Galois deformation rings…
Generalized Goppa codes are defined by a code locator set $\mathcal{L}$ of polynomials and a Goppa polynomial $G(x)$. When the degree of all code locator polynomials in $\mathcal{L}$ is one, generalized Goppa codes are classical Goppa…
In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…
The rapid progression in wireless communication technologies, especially in multicarrier code-division multiple access (MC-CDMA), there is a need of advanced code construction methods. Traditional approaches, mainly based on generalized…