English
Related papers

Related papers: Two-weight codes from trace codes over $R_k$

200 papers

Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first…

Information Theory · Computer Science 2016-11-18 Cunsheng Ding

A statistical estimation algorithm of the weight distribution of a linear code is shown, based on using its generator matrix as a compression function on random bit strings.

Information Theory · Computer Science 2018-06-07 Alessandro Tomasi , Alessio Meneghetti

Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators,…

Combinatorics · Mathematics 2007-07-16 E. M. Rains , N. J. A. Sloane

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

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

Cyclic codes with two zeros and their dual codes as a practically and theoretically interesting class of linear codes, have been studied for many years. However, the weight distributions of cyclic codes are difficult to determine. From…

Information Theory · Computer Science 2015-03-19 Baocheng Wang , Chunming Tang , Yanfeng Qi , Yixian Yang , Maozhi Xu

Solomon and Stiffler constructed infinitely many families of linear codes meeting the Griesmer bound in 1965. It is well-known in 1990's that certain Griesmer codes (codes with the zero Griesmer defect) are equivalent to Solomon-Stiffler…

Information Theory · Computer Science 2026-05-13 Yurui Wang , Hao Chen , Xia Wu

Let $p$ be a prime, and let $N$ be a positive integer such that $p$ is a primitive root modulo $N$. Define $q = p^e$, where $e = \phi(N)$, and let $\mathbb{F}_q$ be the finite field of order $q$ with $\mathbb{F}_p$ as its prime subfield.…

Cryptography and Security · Computer Science 2025-03-26 Kaimin Cheng , Du Sheng

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…

Number Theory · Mathematics 2011-11-15 Maosheng Xiong

In this paper, we consider some structures of linear codes over the ring $\mathcal{R}_k=R[v_1,\dots,v_k],$ where $v_i^2=v_i$ forall $i=1,\dots,k),$ and $R$ is a finite commutative Frobenius ring.

Information Theory · Computer Science 2019-04-16 Irwansyah , Djoko Suprijanto

We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap…

Information Theory · Computer Science 2017-03-20 Trygve Johnsen , Hugues Verdure

We consider weighted Reed-Muller codes over point ensemble $S_1 \times...\times S_m$ where $S_i$ needs not be of the same size as $S_j$. For $m = 2$ we determine optimal weights and analyze in detail what is the impact of the ratio…

Information Theory · Computer Science 2011-09-01 Olav Geil , Casper Thomsen

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…

Information Theory · Computer Science 2017-04-10 Shudi Yang , Xiangli Kong , Chunming Tang

We present an approach to showing that a linear code is resilient to random errors. We use this approach to obtain decoding results for both transitive codes and Reed-Muller codes. We give three kinds of results about linear codes in…

Information Theory · Computer Science 2025-02-27 Anup Rao , Oscar Sprumont

We consider real 2-step metric nilpotent Lie algebras associated to graphs with possibly repeated edge labels as constructed by Ray in 2016. We determine how the structure of the egde labeling within the graph contributes to the abelian…

Differential Geometry · Mathematics 2022-12-20 Rachelle DeCoste , Lisa DeMeyer , Meera Mainkar , Allie Ray

In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given $p,\epsilon>0$, we study (i) The $p$-bounded constraint: a binary vector of size $m$ is said to be $p$-bounded if its weight is at most…

Information Theory · Computer Science 2022-08-22 Tuan Thanh Nguyen , Kui Cai , Han Mao Kiah , Kees A. Schouhamer Immink , Yeow Meng Chee

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

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…

Information Theory · Computer Science 2020-10-26 Simon Eisenbarth , Sihuang Hu

In this paper, a family of six-weight cyclic codes over GF(p) whose duals have two zeros is presented, where p is an odd prime. And the weight distribution of these cyclic codes is determined.

Number Theory · Mathematics 2013-12-18 Yan Liu , Haode Yan , Chunlei Liu

Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…

Combinatorics · Mathematics 2016-08-19 Masaaki Harada , Sho Suda