English
Related papers

Related papers: Trace codes over $\Z_4$ and Boolean function

200 papers

In this paper, a class of two-weight and three-weight linear codes over $\gf(p)$ is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain…

Information Theory · Computer Science 2015-03-24 Kelan Ding , Cunsheng Ding

In this paper we extend the works \cite{gegeng2,XLZD} further in two directions and compute the weight distribution of these cyclic codes under more relaxed conditions. It is interesting to note that many cyclic codes in the family are…

Information Theory · Computer Science 2015-02-17 Maosheng Xiong , Nian Li

Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…

Information Theory · Computer Science 2024-01-24 Yansheng Wu , Chao Li , Lin Zhang , Fu Xiao

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

Two new classes of skew codes over a finite field $\F$ are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew…

Information Theory · Computer Science 2021-02-03 Vladimir Sidorenko , Wenhui Li , Onur Günlü , Gerhard Kramer

Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages…

Information Theory · Computer Science 2017-04-25 Ismail Aydogdu

We introduce the concept of spread of a code, and we specialize it to the case of maximum weight spectrum (MWS) codes. We classify two newly-defined sub-families of MWS codes according to their weight distributions, and completely describe…

Combinatorics · Mathematics 2020-06-09 Alessio Meneghetti , Wrya K. Kadir

Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters…

Information Theory · Computer Science 2019-01-18 Minglong Qi , Shengwu Xiong

We consider codes over $\mathbb{Z}_{p^s}$ with the extended Lee weight. We find Singleton bounds with respect to this weight and define MLDS and MLDR codes accordingly. We also consider the kernels of these codes and the notion of…

Information Theory · Computer Science 2014-07-09 Zeynep Ödemiş Özger , Bahattin Yildiz , Steven Dougherty

In this paper, we apply two-to-one functions over $\mathbb{F}_{2^n}$ in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) $\left(x^{2^t}+x\right)^e$…

Information Theory · Computer Science 2020-06-23 Kangquan Li , Chunlei Li , Tor Helleseth , Longjiang Qu

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 study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in…

Combinatorics · Mathematics 2010-08-12 Julia Galstad , Gerald Hoehn

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

Information Theory · Computer Science 2015-02-17 Haode Yan , Chunlei Liu

Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…

Information Theory · Computer Science 2024-05-20 Shudi Yang , Tonghui Zhang , Zheng-An Yao

In this paper a framework to study the dual of skew cyclic codes is proposed. The transposed Hamming ring extensions are based in the existence of an anti-isomorphism of algebras between skew polynomial rings. Our construction is applied to…

Information Theory · Computer Science 2018-03-02 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro

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

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Information Theory · Computer Science 2016-01-27 Can Xiang , Chunming Tang , Keqin Feng

The weight distribution and weight hierarchy of linear codes are two important research topics in coding theory. In this paper, by choosing proper defining sets from inhomogeneous quadratic functions over $\mathbb{F}_{q}^{2},$ we construct…

Information Theory · Computer Science 2022-06-17 Fei Li , Xiumei Li

Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…

Information Theory · Computer Science 2024-07-16 Bing Chen , Yunge Xu , Zhao Hu , Nian Li , Xiangyong Zeng

Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…

Information Theory · Computer Science 2015-01-05 Jian Gao , Yun Gao , Fang-Wei Fu