SearcharxivSearch

arXiv subjects

Ashish Kumar Upadhyay

Publications and source records attributed to Ashish Kumar Upadhyay.

17 recordsLinked to original sources

On $(θ, Θ)$-cyclic codes and their applications in constructing QECCs

Let $\mathbb F_q$ be a finite field, where $q$ is an odd prime power. Let $R=\mathbb{F}_q+u\mathbb{F}_q+v\mathbb{F}_q+uv\mathbb F_q$ with $u^2=u,v^2=v,uv=vu$. In this paper, we study the algebraic structure of $(θ, Θ)$-cyclic codes of block length $(r,s )$ over $\mathbb{F}_qR.$ Specifically, we analyze the structure of these codes as left $R[x:Θ]$-submodules of $\mathfrak{R}_{r,s} = \frac{\mathbb{F}_q[x:θ]}{\langle x^r-1\rangle} \times \frac{R[x:Θ]}{\langle x^s-1\rangle}$. Our investigation involves determining generator polynomials and minimal generating sets for this family of codes. Further, we discuss the algebraic structure of separable codes. A relationship between the generator polynomials of $(θ, Θ)$-cyclic codes over $\mathbb F_qR$ and their duals is established. Moreover, we calculate the generator polynomials of dual of $(θ, Θ)$-cyclic codes. As an application of our study, we provide a construction of quantum error-correcting codes (QECCs) from $(θ, Θ)$-cyclic codes of block length $(r,s)$ over $\mathbb{F}_qR$. We support our theoretical results with illustrative examples.

cs.IT

On $Z_{p^r}Z_{p^r}Z_{p^s}$-Additive Cyclic Codes

In this paper, we introduce $\mathbb{Z}_{p^r}\mathbb{Z}_{p^r}\mathbb{Z}_{p^s}$-additive cyclic codes for $r\leq s$. These codes can be identified as $\mathbb{Z}_{p^s}[x]$-submodules of $\mathbb{Z}_{p^r}[x]/\langle x^α-1\rangle \times \mathbb{Z}_{p^r}[x]/\langle x^β-1\rangle\times \mathbb{Z}_{p^s}[x]/\langle x^γ-1\rangle$. We determine the generator polynomials and minimal generating sets for this family of codes. Some previous works has been done for the case $p=2$ with $r=s=1$, $r=s=2$, and $r=1,s=2$. However, we show that in these previous works the classification of these codes were incomplete and the statements in this paper complete such classification. We also discuss the structure of separable $\mathbb{Z}_{p^r}\mathbb{Z}_{p^r}\mathbb{Z}_{p^s}$-additive cyclic codes and determine their generator polynomials. Further, we also study the duality of $\mathbb{Z}_{p^s}[x]$-submodules. As applications, we present some examples and construct some optimal binary codes.

cs.IT

Direct Construction of Optimal Z-Complementary Code Sets for all Possible Even Length by Using Pseudo-Boolean Functions

Z-complementary code set (ZCCS) are well known to be used in multicarrier code-division multiple access (MCCDMA) system to provide a interference free environment. Based on the existing literature, the direct construction of optimal ZCCSs are limited to its length. In this paper, we are interested in constructing optimal ZCCSs of all possible even lengths using Pseudo-Boolean functions. The maximum column sequence peakto-man envelop power ratio (PMEPR) of the proposed ZCCSs is upper-bounded by two, which may give an extra benefit in managing PMEPR in an ZCCS based MC-CDMA system, as well as the ability to handle a large number of users.

cs.IT

New Classes of Quantum Codes Associated with Surface Maps

If the cyclic sequences of {face types} {at} all vertices in a map are the same, then the map is said to be a semi-equivelar map. In particular, a semi-equivelar map is equivelar if the faces are the same type. Homological quantum codes represent a subclass of topological quantum codes. In this article, we introduce {thirteen} new classes of quantum codes. These codes are associated with the following: (i) equivelar maps of type $ [k^k]$, (ii) equivelar maps on the double torus along with the covering of the maps, and (iii) semi-equivelar maps on the surface of \Echar{-1}, along with {their} covering maps. The encoding rate of the class of codes associated with the maps in (i) is such that $ \frac{k}{n}\rightarrow 1 $ as $ n\rightarrow\infty $, and for the remaining classes of codes, the encoding rate is $ \frac{k}{n}\rightarrow α$ as $ n\rightarrow \infty $ with $ α< 1 $.

math.CO

Semi-equivelar maps on the surface of Euler genus 3

If the cyclic sequence of faces for all the vertices in a map are of same type, then the map is said to be a semi-equivelar map. In this article, we classify all the types of semi-equivelar maps on the surface of Euler genus 3, $i.e.$, on the surface of Euler characteristic $-1$. That is, we present {a complete map types of} semi-equivelar maps (if exist) on the surface of Euler char. $-1$. We know the complete list of semi-equivelar maps (upto isomorphism) for some types. Here, we also present a complete list of semi-equivelar maps for one type and for other types, similar steps can be followed.

math.CO

On enumeration of a class of toroidal graphs

We present enumerations of a class of toroidal graphs which give rise to semi-equivelar maps. There are eleven different types of semi-equivelar maps on the torus. These are of the types $\{3^{6}\}$, $\{4^{4}\}$, $\{6^{3}\}$, $\{3^{3}, 4^{2}\}$, $\{3^{2}, 4, 3, 4\}$, $\{3, 6, 3, 6\}$, $\{3^{4}, 6\}$, $\{4, 8^{2}\}$, $\{3, 12^{2}\}$, $\{4, 6, 12\}$, $\{3, 4, 6, 4\}$. We know the classification of the maps of types $\{3^{6}\}$, $\{4^{4}\}$, $\{6^{3}\}$ on the torus. In this article, we attempt to classify maps of types $\{3^{3}, 4^{2}\}$, $\{3^{2}, 4, 3, 4\}$, $\{3, 6, 3, 6\}$, $\{3^{4}, 6\}$, $\{4, 8^{2}\}$, $\{3, 12^{2}\}$, $\{4, 6, 12\}$, $\{3, 4, 6, 4\}$ on the torus.

math.CO

On enumeration of a class of maps on Klein bottle

We present enumerations of a class of maps on Klein bottle which give rise to semi-equivelar maps. Semi-equivelar maps are generalizations of equivelar maps. There are eleven types of semi-equivelar maps on the Klein bottle. These are of the types $\{3^{6}\}$, $\{4^{4}\}$, $\{6^{3}\}$, $\{3^{3},$ $4^{2}\}$, $\{3^{2},$ $4,$ $3,$ $4\}$, $\{3,$ $6,$ $3,$ $6\}$, $\{3^{4}, 6\}$, $\{4,$ $8^{2}\}$, $\{3, 12^{2}\}$, $\{4,$ $6,$ $12\}$, $\{3,$ $4,$ $6,$ $4\}$. In this article, we attempt to classify these maps.

math.CO

Hamiltonian Cycles in Polyhedral Maps

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of contractible Hamiltonian cycle in equivelar triangulated maps. We also present an algorithm to construct such cycles whenever it exists.

math.CO

Some Centrally Symmetric Manifolds

We show existence of centrally symmetric maps on surfaces all of whose faces are quadrangles and pentagons for each orientable genus $g \geq 0$. We also show existence of centrally symmetric maps on surfaces all of whose faces are hexagons for each orientable genus $g = 2k-1$, $k\in \mathbb{N}$. We enumerate centrally symmetric triangulated manifolds of dimensions 2 and 3 with few vertices.

math.GT

Hamiltonian Cycle in Semi-Equivelar Maps on the Torus

Semi-Equivelar maps are generalizations of Archimedean solids to the surfaces other than 2-sphere. There are eight semi-equivelar maps of types $\{3^{3},4^{2}\}$, $\{3^{2},4,3,4\}$, $\{6,3,6,3\}$, $\{3^{4},6\}$, $\{4,8^{2}\}$, $\{3,12^{2}\}$, $\{4,6,12\}$, $\{6,4,3,4\}$ exist on the torus. In this article we show the existence of Hamiltonian cycle in each semi-equivelar map on the torus except the map of type $\{3,12^{2}\}$. This result gives the partial solution to the conjecture which is given by Gr$\ddot{u}$nbaum \cite{grunbaum} and Nash-Williams \cite{nash williams} that every 4-connected graph on the torus is Hamiltonian.

math.CO

Contractible Hamiltonian Cycles in Polyhedral Maps

We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown to hold for more general maps.

math.CO

Contractible Hamiltonian Cycles in Triangulated Surfaces

A triangulation of a surface is called $q$-equivelar if each of its vertices is incident with exactly $q$ triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in equivelar triangulation of a surface.

math.GT

Degree-regular triangulations of the double-torus

A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly regular combinatorial 2-manifold is degree-regular and a degree-regular combinatorial 2-manifold of Euler characteristic - 2 must contain 12 vertices. In 1982, McMullen et al. constructed a 12-vertex geometrically realized triangulation of the double-torus in $\RR^3$. As an abstract simplicial complex, this triangulation is a weakly regular combinatorial 2-manifold. In 1999, Lutz showed that there are exactly three weakly regular orientable combinatorial 2-manifolds of Euler characteristic - 2. In this article, we classify all the orientable degree-regular combinatorial 2-manifolds of Euler characteristic - 2. There are exactly six such combinatorial 2-manifolds. This classifies all the orientable equivelar polyhedral maps of Euler characteristic - 2.

math.AT

Degree-regular triangulations of torus and Klein bottle

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In 1999, Lutz has classified all the weakly regular triangulations on at most 15 vertices. In 2001, Datta and Nilakantan have classified all the degree-regular triangulations of closed surfaces on at most 11 vertices. In this article, we have proved that any degree-regular triangulation of the torus is weakly regular. We have shown that there exists an $n$-vertex degree-regular triangulation of the Klein bottle if and only if $n$ is a composite number $\geq 9$. We have constructed two distinct $n$-vertex weakly regular triangulations of the torus for each $n \geq 12$ and a $(4m + 2)$-vertex weakly regular triangulation of the Klein bottle for each $m \geq 2$. For $12 \leq n \leq 15$, we have classified all the $n$-vertex degree-regular triangulations of the torus and the Klein bottle. There are exactly 19 such triangulations, 12 of which are triangulations of the torus and remaining 7 are triangulations of the Klein bottle. Among the last 7, only one is weakly regular.

math.GT