English
Related papers

Related papers: Two weight $\mathbb{Z}_{p^k}$-codes, $p$ odd prime

200 papers

In this paper, $p$ and $q$ are two different odd primes. First, We construct the congruent elliptic curves corresponding to $p$, $2p$, $pq$, and $2pq,$ then, in the cases of congruent numbers, we determine the rank of the corresponding…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Hamid Reza Abdolmaleki

In this paper, for any odd prime $p$ and an integer $m\ge 3$, several classes of linear codes with $t$-weight $(t=3,5,7)$ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by…

Information Theory · Computer Science 2022-08-30 Canze Zhu , Qunying Liao

Let $p$ be a prime number and let $K$ be a genus one two-bridge knot. In the spirit of arithmetic topology, we observe that if $p$ divides the size of the 1st homology group of some odd-th cyclic branched cover of the knot $K$, then its…

Geometric Topology · Mathematics 2026-01-28 Honami Sakamoto , Ryoto Tange , Jun Ueki

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

Number Theory · Mathematics 2025-08-11 Ayla Gafni , Terence Tao

Let $K$ be a cyclic totally real number field of odd degree over $\mathbb{Q}$ with odd class number, such that every totally positive unit is the square of a unit, and such that $2$ is inert in $K/\mathbb{Q}$. We define a family of number…

Number Theory · Mathematics 2021-12-10 Stephanie Chan , Christine McMeekin , Djordjo Milovic

Kurepa's conjecture states that there is no odd prime $p$ that divides $!p=0!+1!+\cdots+(p-1)!$. We search for a counterexample to this conjecture for all $p<2^{34}$. We introduce new optimization techniques and perform the computation…

Number Theory · Mathematics 2016-07-21 Vladica Andrejić , Milos Tatarevic

Let $p$ be a prime number and $\varsigma$ and $m$ be a positive integers. Let $\mathcal{R} = \mathbb{F}_{2^m} + u\mathbb{F}_{2^m} + u^2\mathbb{F}_{2^m}$ ($u^3 = 0$). Cyclic codes of length $2^\varsigma$ over $\mathcal{R}$ are precisely the…

Combinatorics · Mathematics 2025-09-05 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G R

For some extremal (optimal) odd unimodular lattices L in dimensions n=12,16,20,32,36,40 and 44, we determine all positive integers k such that L contains a k-frame. This result yields the existence of an extremal Type I Zk-code of lengths…

Combinatorics · Mathematics 2013-01-23 Masaaki Harada , Tsuyoshi Miezaki

In this paper, using a criterion given by J. Brough and B. Spaeth recently, we verify the inductive blockwise Alperin weight condition for the simple groups PSp2n(q) and any odd prime l not dividing q under some assumptions concerning the…

Representation Theory · Mathematics 2020-05-14 Conghui Li

The behaviour of Hecke polynomials modulo p has been the subject of some study. In this note we show that, if p is a prime, the set of integers N such that the Hecke polynomials T^{N,\chi}_{l,k} for all primes l, all weights k>1 and all…

Number Theory · Mathematics 2009-05-28 L. J. P. Kilford , Gabor Wiese

In a previous paper, the authors showed that two kinds of $p$-adic Siegel--Eisenstein series of degree $n$ coincide with classical modular forms of weight $k$ for $\Gamma _0(p)$, under the assumption that $p$ is a regular prime. The purpose…

Number Theory · Mathematics 2025-02-12 Siegfried Boecherer , Toshiyuki Kikuta

We give formulas, in terms of graph theoretical invariants, for the minimum distance and the generalized Hamming weights of the linear code generated by the rows of the incidence matrix of a signed graph over a finite field, and for those…

Information Theory · Computer Science 2020-09-10 Jose Martinez-Bernal , Miguel A. Valencia , Rafael H. Villarreal

Self-dual double circulant codes of odd dimension are shown to be dihedral in even characteristic and consta-dihedral in odd characteristic. Exact counting formulae are derived for them and used to show they contain families of codes with…

Information Theory · Computer Science 2016-03-03 Adel Alahmadi , Funda Özdemir , Patrick Solé

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

Let $p$ be a prime number and $N$ an integer prime to $p$. We show that the operator $U_p$ on the space of cuspidal modular forms of level $pN$ and weight two is semi-simple. It follows from this that the Hecke algebra acting on the space…

alg-geom · Mathematics 2008-02-03 Robert F. Coleman , Bas Edixhoven

We give a short proof of the following known congruence: for every odd prime $p$ $$\sum_{k=0}^{p-1}{2k\choose k}^2 16^{-k}\equiv (-1)^{{p-1\over 2}}\pmod{p^2}.$$ Moreover, we provide some new results connected with the above congruence.

Number Theory · Mathematics 2009-11-24 Roberto Tauraso

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…

Information Theory · Computer Science 2016-05-12 Ziling Heng , Qin Yue

In this article we show that for every prime number $p$, any irreducible homogeneous locally nilpotent derivations of rank $2$ and degree $p-2$ are triangularizable. Further, we describe the structure of irreducible non-triangularizable…

Commutative Algebra · Mathematics 2024-03-22 Parnashree Ghosh

This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…

Combinatorics · Mathematics 2010-03-02 Norman Biggs

The purpose of this paper is to study the cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$. After providing the generator polynomial of cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$, we give the necessary and sufficient condition…

Information Theory · Computer Science 2015-07-14 Abhay Kumar Singh , Narendra Kumar