Searcharxiv⌕ Search

arXiv subjects

Pramod Kumar Kewat

Publications and source records attributed to Pramod Kumar Kewat.

12 recordsLinked to original sources
arXiv2026

On the Hamming Distance and LCD Properties of Binary Polycyclic Codes and Their Duals

Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of irreducible polynomials. We first determine their complete algebraic structure and then develop general results on their minimum Hamming distance, including several exact values and bounds. We also examine the Euclidean duals of these codes and derive corresponding results on the Hamming distance of the dual codes. Furthermore, we study the LCD (linear complementary dual) properties of binary polycyclic codes, establish necessary and sufficient conditions for such codes to be LCD codes, and construct several families of binary LCD codes. Our constructions also yield many optimal and LCD optimal binary linear codes, including codes of larger lengths. We then focus on binary polycyclic codes associated with powers of the self-reciprocal irreducible trinomials $x^{2\cdot3^v}+x^{3^v}+1$, where $v\geq0$. For this class, we determine the exact Hamming distance of all such codes and show that these codes are reversible. Moreover, we show that these codes are LCD codes in certain cases. In addition, we propose a conjecture asserting that all binary polycyclic codes associated with $\big(x^{2\cdot3^v}+x^{3^v}+1\big)^{2^\mathcal{T}}$, where $v\geq 0$ and $\mathcal{T}\geq1$, are LCD codes. These results demonstrate that binary polycyclic codes form a rich source of structured codes with strong distance, duality, reversibility, and LCD properties.

cs.IT↗
arXiv2022

A class of few-Lee weight $\mathbb{Z}_2[u]$-linear codes using simplicial complexes and minimal codes via Gray map

Recently some mixed alphabet rings are involved in constructing few-Lee weight additive codes with optimal or minimal Gray images using suitable defining sets or down-sets. Inspired by these works, we choose the mixed alphabet ring $\mathbb{Z}_2\mathbb{Z}_2[u]$ to construct a special class of linear code $C_L$ over $\mathbb{Z}_2[u]$ with $u^2=0$ by employing simplicial complexes generated by a single maximal element. We show that $C_L$ has few-Lee weights by determining the Lee weight distribution of $C_L$. Theoretically, this shows that we may employ simplicial complexes to obatin few-weight codes even in the case of mixed alphabet rings. We show that the Gray image of $C_L$ is self-orthogonal and we have an infinite family of minimal codes over $\mathbb{Z}_2$ via Gray map, which can be used to secret sharing schemes.

cs.IT↗
arXiv2021

Generalizations of Jacobsthal sums and hypergeometric series over finite fields

For non-negative integers $l_{1}, l_{2},\ldots, l_{n}$, we define character sums $φ_{(l_{1}, l_{2},\ldots, l_{n})}$ and $ψ_{(l_{1}, l_{2},\ldots, l_{n})}$ over a finite field which are generalizations of Jacobsthal and modified Jacobsthal sums, respectively. We express these character sums in terms of Greene's finite field hypergeometric series. We then express the number of points on the hyperelliptic curves $y^2=(x^m+a)(x^m+b)(x^m+c)$ and $y^2=x(x^m+a)(x^m+b)(x^m+c)$ over a finite field in terms of the character sums $φ_{(l_{1}, l_{2}, l_{3})}$ and $ψ_{(l_{1}, l_{2}, l_{3})}$, and finally obtain expressions in terms of the finite field hypergeometric series.

math.NT↗
arXiv2019

Hypergeometric functions and algebraic curves $y^e=x^d+ax+b$

Let $q$ be a prime power and $\mathbb{F}_q$ be a finite field with $q$ elements. Let $e$ and $d$ be positive integers. In this paper, for $d\geq2$ and $q\equiv1(\mathrm{mod}~ed(d-1))$, we calculate the number of points on an algebraic curve $E_{e,d}:y^e=x^d+ax+b$ over a finite field $\mathbb{F}_q$ in terms of $_dF_{d-1}$ Gaussian hypergeometric series with multiplicative characters of orders $d$ and $e(d-1)$, and in terms of $_{d-1}F_{d-2}$ Gaussian hypergeometric series with multiplicative characters of orders $ed(d-1)$ and $e(d-1)$. This helps us to express the trace of Frobenius endomorphism of an algebraic curve $E_{e,d}$ over a finite field $\mathbb{F}_q$ in terms of the above hypergeometric series. As applications, we obtain some transformations and special values of $_2F_{1}$ Gaussian hypergeometric series.

math.NT↗
arXiv2016

Autocorrelation values and Linear complexity of generalized cyclotomic sequence of order four, and construction of cyclic codes

Let $n_1$ and $n_2$ be two distinct primes with $\mathrm{gcd}(n_1-1,n_2-1)=4$. In this paper, we compute the autocorrelation values of generalized cyclotomic sequence of order $4$. Our results show that this sequence can have very good autocorrelation property. We determine the linear complexity and minimal polynomial of the generalized cyclotomic sequence over $\mathrm{GF}(q)$ where $q=p^m$ and $p$ is an odd prime. Our results show that this sequence possesses large linear complexity. So, the sequence can be used in many domains such as cryptography and coding theory. We employ this sequence of order $4$ to construct several classes of cyclic codes over $\mathrm{GF}(q)$ with length $n_1n_2$. We also obtain the lower bounds on the minimum distance of these cyclic codes.

cs.IT↗
arXiv2015

Cyclic codes over the ring $\mathbb{F}_p[u,v,w]/\langle u^2, v^2, w^2, uv-vu, vw-wv, uw-wu \rangle$

In this paper, we investigate cyclic codes over the ring $ \mathbb{F}_p[u,v,w]\langle u^2,$ $v^2, w^2$, $uv-vu, vw-wv, uw-wu \rangle$, where $p$ is a prime number. Which is a part of family of Frobenius rings. We find a unique set of generators for these codes and characterize the free cyclic codes. We also study the rank and the Hamming distance of these codes. We also constructs some good $p-ary$ codes as the Gray images of these cyclic codes.

cs.IT↗
arXiv2015

Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6

Binary Whiteman's cyclotomic sequences of orders 2 and 4 have a number of good randomness properties. In this paper, we compute the autocorrelation values and linear complexity of the first class two-prime Whiteman's generalized cyclotomic sequence (WGCS-I) of order $d=6$. Our results show that the autocorrelation values of this sequence is four-valued or five-valued if $(n_1-1)(n_2-1)/36$ is even or odd respectively, where $n_1$ and $n_2$ are two distinct odd primes and their linear complexity is quite good. We employ the two-prime WGCS-I of order 6 to construct several classes of cyclic codes over $\mathrm{GF}(q)$ with length $n_1n_2$. We also obtain the lower bounds on the minimum distance of these cyclic codes.

cs.IT↗
arXiv2014

Cyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$

Let $p$ be a prime number. In this paper, we study cyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes. We obtain all except one ternary optimal code of length 12 as the Gray image of the cyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$. We also characterize the $p$-ary image of these cyclic codes under the Gray map.

cs.IT↗
arXiv2012

On the local and global exterior square L-functions

We show that the local exterior square L-functions of GL_n constructed via the theory of integral representations by Jacquet and Shalika coincide with those constructed by the Langlands-Shahidi method for square integrable representations (and for all irreducible representations when n is even). We also deduce several local and global consequences.

math.NT↗