English
Related papers

Related papers: Weight Distribution of A p-ary Cyclic Code

200 papers

There are two outstanding questions about division algebras of prime degree $p$. The first is whether they are cyclic, or equivalently crossed products. The second is whether the center, $Z(F,p)$, of the generic division algebra $UD(F,p)$…

Rings and Algebras · Mathematics 2024-09-12 David J Saltman

In this paper, we study constacyclic codes over $F_p+vF_p$, where $p$ is an odd prime and $v^2=v$. The polynomial generators of all constacyclic codes over $F_p+vF_p$ are characterized and their dual codes are also determined.

Information Theory · Computer Science 2013-01-07 Guanghui Zhang , Bocong Chen

Up to a new invariant $\mu(b)$, the complete $b$-symbol weight distribution of a particular kind of two-weight irreducible cyclic codes, was recently obtained by Zhu et al. [Des. Codes Cryptogr., 90 (2022) 1113-1125]. The purpose of this…

Information Theory · Computer Science 2022-06-08 Gerardo Vega

Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…

Information Theory · Computer Science 2024-10-04 Xiumei Li , Zongxi Chen , Fei Li

If $N = {p^k}{m^2}$ is an odd perfect number with special prime factor $p$, then it is proved that ${p^k} < (2/3){m^2}$. Numerical results on the abundancy indices $\frac{\sigma(p^k)}{p^k}$ and $\frac{\sigma(m^2)}{m^2}$, and the ratios…

Number Theory · Mathematics 2012-06-18 Jose Arnaldo B. Dris

Let $p$ be an odd prime number. In this paper, we characterize the nonabelian composition factors of a finite group with odd $p$-Sylow automizers, and then prove that the McKay conjecture, the Alperin weight conjecture and the Alperin-McKay…

Group Theory · Mathematics 2018-07-27 Chaida Xu , Yuanyang Zhou

As a subclass of linear codes, cyclic codes have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, five families of three-weight…

Information Theory · Computer Science 2013-08-27 Cunsheng Ding , Ying Gao , Zhengchun Zhou

Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let…

Probability · Mathematics 2016-08-09 Ljuben Mutafchiev

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} \sum\limits_{i+j+k=p^{r}\atop{i,j,k\in \mathcal{P}_{p}}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} ~(\bmod ~…

Number Theory · Mathematics 2015-03-12 Zhongyan Shen , Tianxin Cai

We prove that for forms of U(3) which are compact at infinity and split at places dividing a prime p, in generic situations the Serre weights of a mod p modular Galois representation which is irreducible when restricted to each…

Number Theory · Mathematics 2019-12-19 Matthew Emerton , Toby Gee , Florian Herzig

Let $\mathbb{F}_{2^m}$ be a finite field of characteristic $2$ and $R=\mathbb{F}_{2^m}[u]/\langle u^k\rangle=\mathbb{F}_{2^m} +u\mathbb{F}_{2^m}+\ldots+u^{k-1}\mathbb{F}_{2^m}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For…

Information Theory · Computer Science 2015-11-18 Yonglin Cao , Yuan Cao , Fang-Wei Fu

As a subclass of linear codes, cyclic codes have efficient encoding and decoding algorithms, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, we give a…

Information Theory · Computer Science 2019-08-09 Yan Liu , Xiwang Cao

In this article, we investigate properties of cyclic codes over a finite non-chain ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,$ where $q=p^r,$ $r$ is a positive integer, $p$ is an odd prime, $4 \mid…

Information Theory · Computer Science 2021-12-30 Djoko Suprijanto , Hopein Christofen Tang

A weighing matrix $W$ of order $n=\frac{p^{m+1}-1}{p-1}$ and weight $p^m$ is constructed and shown that the rows of $W$ and $-W$ form optimal constant weight ternary codes of length $n$, weight $p^m$ and minimum distance…

Combinatorics · Mathematics 2021-12-09 Hadi Kharaghani , Sho Suda , Vlad Zaitsev

For cyclic totally real number fields $K$ with odd prime degree $n$, odd class number, $2$ inert, and the property that every totally positive unit is a square, the density of rational primes $p$ that satisfy the spin relation…

Number Theory · Mathematics 2021-01-06 Christine McMeekin

Let $R=\mathbb{Z}_{4}[v]/\langle v^2+2v\rangle=\mathbb{Z}_{4}+v\mathbb{Z}_{4}$ ($v^2=2v$) and $n$ be an odd positive integer. Then $R$ is a local non-principal ideal ring of $16$ elements and there is a $\mathbb{Z}_{4}$-linear Gray map from…

Information Theory · Computer Science 2018-03-02 Yuan Cao , Yonglin Cao

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

Information Theory · Computer Science 2021-04-09 Xina Zhang

Given integers $k,l\geq 2$, where either $l$ is odd or $k$ is even, let $n(k,l)$ denote the largest integer $n$ such that each element of $A_n$ is a product of $k$ many $l$-cycles. In 2008, M. Herzog, G. Kaplan and A. Lev proved that if…

Combinatorics · Mathematics 2023-04-25 Harish Kishnani , Rijubrata Kundu , Sumit Chandra Mishra

Let $k$ be a given positive odd integer and $p$ an odd prime. In this paper, we shall give a sufficient condition when a prime $p$ divides the order of the groups $K_{2k}(\mathbb{Z}[\zeta_m+\zeta_m^{-1}])$ and $K_{2k}(\mathbb{Z}[\zeta_m])$,…

Number Theory · Mathematics 2025-08-06 Meng Fai Lim

In this paper, we investigate cyclic code over the ring $\mathbb{F}_{p^k} + v\mathbb{F}_{p^k} + v^2\mathbb{F}_{p^k} + ... + v^r\mathbb{F}_{p^k}$, where $v^{r+1}=v$, $p$ a prime number, $r>1$ and $\gcd(r,p)=1$, we prove as generalisation of…

Information Theory · Computer Science 2015-11-09 Ousmane Ndiaye