English
Related papers

Related papers: Binary Linear Codes From Vectorial Boolean Functio…

200 papers

We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…

Information Theory · Computer Science 2026-03-05 Antonio Jesús Lorite López , Daniel Camazón Portela , Juan Antonio López Ramos

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

Binary codes have been widely used in vision problems as a compact feature representation to achieve both space and time advantages. Various methods have been proposed to learn data-dependent hash functions which map a feature vector to a…

Computer Vision and Pattern Recognition · Computer Science 2014-10-22 Jie Feng , Wei Liu , Yan Wang

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

In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to…

Information Theory · Computer Science 2024-12-23 Cong Yu , Shixin Zhu , Hao Chen , Yang Li , Xiuyu Zhang

In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures. In our first approach, we compute the sizes of constrained subcodes of linear codes. Since there exist well-known linear codes that achieve…

Information Theory · Computer Science 2023-04-20 V. Arvind Rameshwar , Navin Kashyap

Recently, there has been intensive research on the weight distributions of cyclic codes. In this paper, we compute the weight distributions of three classes of cyclic codes with Niho exponents. More specifically, we obtain two classes of…

Information Theory · Computer Science 2014-01-10 Shuxing Li , Tao Feng , Gennian Ge

A lot of attention has been paid to the investigation of the algebraic properties of linear codes. In most cases, this investigation involves the determination of required code automorphisms, which are useful for decoders, such as the…

Combinatorics · Mathematics 2024-06-04 Ma Jicheng , Yan Guiying

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

Because of efficient encoding and decoding algorithms, cyclic codes are an important family of linear block codes, and have applications in communica- tion and storage systems. However, their weight distributions are known only for a few…

Information Theory · Computer Science 2013-02-05 Xiaogang Liu , Yuan Luo

We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…

Information Theory · Computer Science 2009-09-29 Gérard Cohen , Alexander Vardy

We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…

Combinatorics · Mathematics 2023-05-23 Michael Kiermaier , Sascha Kurz

Subfield codes of linear codes over finite fields have recently received much attention. Some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, the $q$-ary…

Information Theory · Computer Science 2023-03-08 Li Xu , Cuiling Fan , Sihem Mesnager , Rong Luo , Haode Yan

Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…

Combinatorics · Mathematics 2019-04-10 Xiaoni Du , Rong Wang , Cuiling Fan

Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical…

Information Theory · Computer Science 2014-04-29 Michael Helmling , Stefan Ruzika , Akin Tanatmis

Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations…

Information Theory · Computer Science 2016-11-18 Gottfried Lechner , Troels Pedersen , Gerhard Kramer

In this paper, we have introduced the concepts of support distribution and the support enumerator as refinements of the classical weight distribution and weight enumerator respectively, capturing coordinate level activity in linear block…

Information Theory · Computer Science 2026-01-14 Nitin Kenjale , Anuradha S. Garge

A Type IV-II Z4-code is a self-dual code over Z4 with the property that all Euclidean weights are divisible by eight and all codewords have even Hamming weight. In this paper we use generalized bent functions for a construction of…

Information Theory · Computer Science 2022-11-03 Sara Ban , Sanja Rukavina

In this study, linear codes having their Lee-weight distributions over the semi-local ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^{2}=1$ are constructed using the defining set and Gauss sums for an odd prime $q $. Moreover, we derive…

Information Theory · Computer Science 2024-07-08 Pavan Kumar , Noor Mohammad Khan

Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…

Information Theory · Computer Science 2011-11-15 Cunsheng Ding