English
Related papers

Related papers: A class of ternary codes with few weights

200 papers

We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…

Information Theory · Computer Science 2016-12-06 Minjia Shi , Daitao Huang , Patrick Sole

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

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $\alpha $ be a generator of…

Information Theory · Computer Science 2024-07-11 Gaofei Wu , Zhuohui You , Zhengbang Zha , Yuqing Zhang

We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary $(n=2^m-3, 2^{n-m-1}, 4)$ code $C$, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of…

Information Theory · Computer Science 2012-06-25 Denis Krotov

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

Let $m\geq 3$ be an odd integer and $p$ be an odd prime. % with $p-1=2^rh$, where $h$ is an odd integer. In this paper, many classes of three-weight cyclic codes over $\mathbb{F}_{p}$ are presented via an examination of the condition for…

Information Theory · Computer Science 2013-08-28 Chunlei Li , Nian Li , Tor Helleseth , Cunsheng Ding

In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size $M=2^k$. For every integer $\ell \geq 3$, we construct a $(n=2^\ell, M=2^{k_{\ell}},…

Information Theory · Computer Science 2024-07-02 Birenjith Sasidharan , Emanuele Viterbo , Son Hoang Dau

Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in $\ell_1$-metric. By using packings and group divisible designs in combinatorial design theory, we give…

Information Theory · Computer Science 2020-10-12 Tingting Chen , Yiming Ma , Xiande Zhang

In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…

Information Theory · Computer Science 2025-10-13 Ankit Yadav , Ritumoni Sarma , Anuj Kumar Bhagat

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem…

Combinatorics · Mathematics 2019-01-25 Dongchun Han , Haode Yan

Let $q=2^n$, $0\leq k\leq n-1$, $n/\gcd(n,k)$ be odd and $k\neq n/3, 2n/3$. In this paper the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\mathrm{Tr}_1^n(\alpha x^{2^{2k}+1}+\beta x^{2^k+1}+\ga…

Information Theory · Computer Science 2009-04-16 Jinquan Luo

Let $\mathbb{F}_{p^m}$ be a finite field with $p^m$ elements, where $p$ is an odd prime and $m$ is a positive integer. Recently, \cite{Hengar} and \cite{Wang2020} determined the weight distributions of subfield codes with the form…

Information Theory · Computer Science 2020-12-14 Dabin Zheng , Xiaoqiang Wang , Yayao Li , Mu Yuan

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é

A linear code $C$ over $\mathbb{F}_q$ is called $\Delta$-divisible if the Hamming weights $\operatorname{wt}(c)$ of all codewords $c \in C$ are divisible by $\Delta$. The possible effective lengths of $q^r$-divisible codes have been…

Combinatorics · Mathematics 2025-02-19 Sascha Kurz

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-07-12 Gerardo Vega , Félix Hernández

We study codes with parameters of the ternary Hamming $(n=(3^m-1)/2,3^{n-m},3)$ code, i.e., ternary $1$-perfect codes. The rank of the code is defined to be the dimension of its affine span. We characterize ternary $1$-perfect codes of rank…

Combinatorics · Mathematics 2023-04-11 Minjia Shi , Denis S. Krotov

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

In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…

Information Theory · Computer Science 2020-09-11 Dabin Zheng , Qing Zhao , Xiaoqiang Wang , Yan Zhang

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem…

Information Theory · Computer Science 2014-10-03 Wei Hengjia , Zhang Hui , Zhu Mingzhi , Ge Gennian

Cyclic codes have efficient encoding and decoding algorithms over finite fields, so that they have practical applications in communication systems, consumer electronics and data storage systems. The objective of this paper is to give eight…

Information Theory · Computer Science 2022-05-02 Lanqiang Li , Li Liu , Shixin Zhu
‹ Prev 1 2 3 10 Next ›