English
Related papers

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

200 papers

We prove that weights of two Siegel modular forms of nonquadratic nebentypus should satisfy some congruence relations if these modular forms are congruent to each other. Applying this result, we prove that there are no mod $p$ singular…

Number Theory · Mathematics 2024-02-06 Siegfried Boecherer , Toshiyuki Kikuta

Let $h_{(m,k)}$ be the class number of $\mathbb{Q}(\sqrt{1-2m^k}).$ We prove that for any odd natural number $k,$ there exists $m_0$ such that $k \mid h_{(m,k)}$ for all odd $m > m_0.$ We also prove that for any odd $m \geq 3,$ $k \mid…

Number Theory · Mathematics 2024-03-06 Srilakshmi Krishnamoorthy , R. Muneeswaran

For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…

Information Theory · Computer Science 2024-06-27 Pavan Kumar , Noor Mohammad Khan

Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it…

Information Theory · Computer Science 2021-09-28 Tuvi Etzion

We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the…

Information Theory · Computer Science 2016-12-02 Yan Liu , Minjia Shi , Patrick Solé

In this paper we construct a cover {a_s(mod n_s)}_{s=1}^k of Z with odd moduli such that there are distinct primes p_1,...,p_k dividing 2^{n_1}-1,...,2^{n_k}-1 respectively. Using this cover we show that for any positive integer m divisible…

Number Theory · Mathematics 2008-11-29 Ke-Jian Wu , Zhi-Wei Sun

Orthogonal designs and weighing matrices have many applications in areas such as coding theory, cryptography, wireless networking and communication. In this paper, we first show that if positive integer $k$ cannot be written as the sum of…

Combinatorics · Mathematics 2016-02-26 Ebrahim Ghaderpour

We consider the problem of existence of perfect $2$-colorings in the Doob graphs $D(m,n)$ and $4$-ary Hamming graphs $H(n,4)$. We characterize all parameters for which multifold $1$-perfect code in $D(m,n)$ exists. Also, we prove that for…

Combinatorics · Mathematics 2023-12-13 Evgeny Bespalov

We prove that the Galois pseudo-representation valued in the mod $p^n$ cuspidal Hecke algebra for GL(2) over a totally real number field $F$, of parallel weight $1$ and level prime to $p$, is unramified at any place above $p$. The same is…

Number Theory · Mathematics 2024-09-18 Shaunak V. Deo , Mladen Dimitrov , Gabor Wiese

We investigate perfect codes in $\mathbb{Z}^n$ under the $\ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$,…

Combinatorics · Mathematics 2015-11-11 Antonio Campello , Grasiele C. Jorge , and João Strapasson , Sueli I. R. Costa

Let $m$, $k$ be positive integers such that $\frac{m}{\gcd(m,k)}\geq 3$, $p$ be an odd prime and $\pi $ be a primitive element of $\mathbb{F}_{p^m}$. Let $h_1(x)$ and $h_2(x)$ be the minimal polynomials of $-\pi^{-1}$ and…

Information Theory · Computer Science 2014-07-09 Long Yu , Hongwei Liu

Let $p$ be a prime number and $s> 0$ an integer. In this short note, we investigate one-point geometric Goppa codes associated with an elementary abelian $p$-extension of $\mathbb{F}_{p^{s}}(x)$. We determine their dimension and the exact…

Information Theory · Computer Science 2020-07-08 Nupur Patanker , Sanjay Kumar Singh

Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…

Information Theory · Computer Science 2017-12-05 Hongwei Liu , Youcef Maouche

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie

We study congruences modulo powers of a prime $p$ between pairs of $p$-new modular Hecke eigenforms of level $\Gamma_0(p)$ and same weight $k$. Based on explicit computations, we conjecture that every such eigenform $f$ admits a twin to…

Number Theory · Mathematics 2026-02-18 Andrea Conti , Peter Mathias Gräf

For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these codes have different ranks.

Information Theory · Computer Science 2008-05-10 Denis Krotov

For an odd prime $p$, we realize the trivial representation of $\mathrm{GL}_2(\mathbb{Z}/p^n\mathbb{Z})$ on the free $\mathbb{Z}/p^n \mathbb{Z}$-module of rank one as a subquotient of a direct sum of symmetric power representations (twisted…

Representation Theory · Mathematics 2025-10-10 Atsushi Ichino , Kartik Prasanna

Let $p$ be an odd prime, and let $a$ be a rational $p$-adic integer with $a\not\equiv 0\pmod p$. In this paper, using WZ method we establish the congruences for $\sum_{k=0}^{p-1} \binom ak^2(-1)^k(1-\frac 2ak)$ modulo $p^2$ and…

Number Theory · Mathematics 2022-04-22 Zhi-Hong Sun

Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…

Information Theory · Computer Science 2024-08-20 Xu Pan , Hao Chen , Hongwei Liu , Shengwei Liu

Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…

Information Theory · Computer Science 2017-09-19 Minjia Shi , Zhongyi Zhang , Patrick Sole