English
Related papers

Related papers: Average of complete joint weight enumerators and s…

200 papers

In this paper, we give various identities for the weighted average of the product of generalized Anderson-Apostol sums with weights concerning completely multiplicative function, completely additive function, logarithms, the Gamma function,…

Number Theory · Mathematics 2021-02-08 Isao Kiuchi , Friedrich Pillichshammer , Sumaia Saad Eddin

A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…

Information Theory · Computer Science 2021-11-15 Gerardo Vega , Félix Hernández

In this manuscript, we construct a class of projective three-weight linear codes and two classes of projective four-weight linear codes over F2 from the defining sets construction, and determine their weight distributions by using additive…

Information Theory · Computer Science 2025-11-04 Qunying Liao , Zhaohui Zhang , Peipei Zheng

In this paper, we study linear codes over $\mathbb{Z}_k$ based on lattices and theta functions. We obtain the complete weight enumerators MacWilliams identity and the symmetrized weight enumerators MacWilliams identity based on the theory…

Information Theory · Computer Science 2025-04-18 Zhiyong Zheng , Fengxia Liu , Kun Tian

In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…

Information Theory · Computer Science 2018-07-03 Minjia Shi , Hongwei Zhu , Patrick Solé

Relations between the local weight distributions of a binary linear code, its extended code, and its even weight subcode are presented. In particular, for a code of which the extended code is transitive invariant and contains only codewords…

Information Theory · Computer Science 2016-11-17 Kenji Yasunaga , Toru Fujiwara

For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…

Information Theory · Computer Science 2024-05-31 Chiara Castello , Olga Polverino , Ferdinando Zullo

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

Information Theory · Computer Science 2025-12-03 Cristina Fernández-Córdoba , Sergi Sánchez-Aragón , Mercè Villanueva

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we use the method developed before to solve one more special case. We make extensive use of standard…

Number Theory · Mathematics 2012-10-17 Maosheng Xiong

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

Information Theory · Computer Science 2015-12-23 Can Xiang

In this article, the effective lengths of all $q^r$-divisible linear codes over $\mathbb{F}_q$ with a non-negative integer $r$ are determined. For that purpose, the $S_q(r)$-adic expansion of an integer $n$ is introduced. It is shown that…

Combinatorics · Mathematics 2020-01-31 Michael Kiermaier , Sascha Kurz

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

Let $P$ be a partial order on $[n] = \{1,2,\ldots,n\}$, $\mathbb{F}_{q}^n$ be the linear space of $n$-tuples over a finite field $\mathbb{F}_{q}$ and $w$ be a weight on $\mathbb{F}_{q}$. In this paper, we consider metrics on…

Information Theory · Computer Science 2021-01-19 Luciano Panek , Nayene Michele Paião Panek

In this paper, we characterize the average Hamming weight distribution of subsequences of maximum-length sequences ($m$-sequences). In particular, we consider all possible $m$-sequences of dimension $k$ and find the average number of…

Information Theory · Computer Science 2021-07-13 Mahyar Shirvanimoghaddam

This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary…

Information Theory · Computer Science 2007-07-13 Yeow Meng Chee , San Ling

We consider a disjoint cover (partition) of an undirected weighted finite graph $G$ by $|J|$ connected subgraphs (clusters) $\{S_{j}\}_{j\in J}$ and select a function $\zeta_{j}\geq 0$ on each of the clusters. For a given signal $f$ on $G$…

Functional Analysis · Mathematics 2023-08-09 Isaac Pesenson

In this paper, we study the third weight of generalized Reed-Muller codes. We prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of…

Information Theory · Computer Science 2014-01-22 Elodie Leducq

Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…

Information Theory · Computer Science 2017-07-25 Ziling Heng , Qin Yue

In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Keqing Cao

We consider the ensemble average of two dimensional symmetric product orbifold CFTs $\text{Sym}^N(\mathbb{T}^D)$ over the Narain moduli space. We argue for a bulk dual given by $N$ copies of an abelian Chern-Simons theory coupled to…

High Energy Physics - Theory · Physics 2024-03-25 Joshua Kames-King , Alexandros Kanargias , Bob Knighton , Mykhaylo Usatyuk