English
Related papers

Related papers: Optimal three-weight cubic codes

200 papers

In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…

Information Theory · Computer Science 2021-11-22 Canze Zhu , Qunying Liao

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. Let $m=2\ell+1$ for an integer $\ell\geq 1$…

Information Theory · Computer Science 2015-10-20 Cuiling Fan , Nian Li , Zhengchun Zhou

In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring…

Information Theory · Computer Science 2020-02-27 Steven T. Dougherty , Joe Gildea , Adrian Korban , Abidin Kaya

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

We obtain all possible parameters of Plotkin-optimal two-Lee weight projective codes over $\mathbb{Z}_4,$ together with their weight distributions. We show the existence of codes with these parameters as well as their weight distributions…

Information Theory · Computer Science 2024-01-25 Hopein Christofen Tang , Djoko Suprijanto

Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights…

Information Theory · Computer Science 2020-07-23 Guangkui Xu , Xiwang Cao

Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun {\em et al.} We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to…

Information Theory · Computer Science 2020-08-18 Jong Yoon Hyun , Hyun Kwang Kim , Yansheng Wu , Qin Yue

In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.

Information Theory · Computer Science 2017-06-28 Long Yu , Xiusheng Liu

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

Combinatorics · Mathematics 2018-04-20 Alessio Meneghetti

Based on a generic construction, two classes of ternary three-weight linear codes are obtained from a family of power functions, including some APN power functions. The weight distributions of these linear codes are determined through…

Information Theory · Computer Science 2016-04-12 Yongbo Xia , Chunlei Li

In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which…

Quantum Physics · Physics 2009-11-13 Dan Hu , Weidong Tang , Meisheng Zhao , Qing Chen , Sixia Yu , C. H. Oh

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

Information Theory · Computer Science 2025-04-22 Mrinal Kanti Bose , Udaya Parampalli , Abhay Kumar Singh

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

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-05-03 Tingfang Chen , Cunsheng Ding , Chengju Li , Zhonghua Sun

Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do…

Information Theory · Computer Science 2017-03-27 Sihem Mesnager , Ferruh Özbudak , Ahmet Sınak

Using theoretical results about the homogeneous weights for Frobenius rings, we describe the homogeneous weight for the ring family $R_k$, a recently introduced family of Frobenius rings which have been used extensively in coding theory. We…

Information Theory · Computer Science 2015-04-17 Bahattin Yildiz , Ismail G. Kelebek

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

Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction…

Information Theory · Computer Science 2015-10-20 Ziling Heng , Qin Yue

Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their…

Information Theory · Computer Science 2013-01-25 Zhengchun Zhou , Aixian Zhang , Cunsheng Ding , Maosheng Xiong

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…

Information Theory · Computer Science 2020-01-07 Ziling Heng , Cunsheng Ding , Weiqiong Wang
‹ Prev 1 4 5 6 7 8 10 Next ›