600 results
Search Results
2. New Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes From Their Zeros.
- Author
-
Qiu, Jing, Zheng, Dabin, and Fu, Fang-Wei
- Subjects
CYCLIC codes ,REED-Solomon codes ,PAPER arts ,GENERALIZATION - Abstract
An $(r, \delta)$ -locally repairable code ($(r, \delta)$ -LRC for short) was introduced by Prakash et al. for tolerating multiple failed nodes in distributed storage systems, which was a generalization of the concept of $r$ -LRCs produced by Gopalan et al.. An $(r, \delta)$ -LRC is said to be optimal if it achieves the Singleton-like bound. Recently, Chen et al. generalized the construction of cyclic $r$ -LRCs proposed by Tamo et al. , and constructed several classes of optimal $(r, \delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively in terms of a union of the set of zeros controlling the minimum distance and the set of zeros ensuring the locality. Following the work of , , this paper first characterizes $(r, \delta)$ -locality of a cyclic code via its zeros. Then we construct several classes of optimal cyclic $(r, \delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively from the product of two sets of zeros. Our constructions include all optimal cyclic $(r,\delta)$ -LRCs proposed in , , and our method seems more convenient to obtain optimal cyclic $(r, \delta)$ -LRCs with flexible parameters. Moreover, many optimal cyclic $(r,\delta)$ -LRCs of length $n$ for $n\, |\, (q-1)$ or $n\,|\, (q+1)$ , respectively with $(r+\delta -1)\nmid n$ can be obtained from our method. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
3. Weight Enumerators and Cardinalities for Number-Theoretic Codes.
- Author
-
Nozaki, Takayuki
- Subjects
HAMMING weight ,RINGS of integers ,BINARY codes ,LINEAR codes ,ERROR-correcting codes - Abstract
The number-theoretic code is a class of codes defined by single or multiple congruences. These codes are mainly used for correcting insertion and deletion errors, and for correcting asymmetric errors. This paper presents a formula for a generalization of the complete weight enumerator for the number-theoretic codes. This formula allows us to derive the weight enumerators and cardinalities for the number-theoretic codes. As a special case, this paper provides the Hamming weight enumerators and cardinalities of the non-binary Tenengolts’ codes, correcting single insertion or deletion. Moreover, we show that the formula deduces the MacWilliams identity for the linear codes over the ring of integers modulo $r$. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F* q 2.
- Author
-
Heng, Ziling, Li, Chengju, and Wang, Xinran
- Subjects
CYCLIC codes ,LINEAR codes ,CYCLIC loads - Abstract
Linear codes achieving or nearly achieving the Singleton bound are interesting in both theory and practice. The objective of this paper is to construct several infinite families of MDS, near MDS and almost MDS codes from some special cyclic subgroups of ${\mathbb {F}}_{q^{2}}^{*}$. To this end, the augmentation and extension techniques are used. The codes in this paper have flexible parameters and their lengths could be large. The minimum linear locality of the codes constructed in this paper is also studied. Some infinite families of optimal linearly locally recoverable codes are obtained. Besides, some codes in this paper are proved to be proper for error detection. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Fundamental Limits of Distributed Linear Encoding.
- Author
-
Khooshemehr, Nastaran Abadi and Maddah-Ali, Mohammad Ali
- Subjects
CODING theory ,FINITE fields ,ENCODING ,LINEAR systems ,CHANNEL coding ,LINEAR codes - Abstract
In general coding theory, we often assume that error is observed in transferring or storing encoded symbols, while the process of encoding itself is error-free. Motivated by recent applications of coding theory, in this paper, we consider the case where the process of encoding is distributed and prone to error. We introduce the problem of distributed encoding, comprised of a set of $K \in \mathbb {N}$ isolated source nodes and $N \in \mathbb {N}$ encoding nodes. Each source node has one symbol from a finite field, which is sent to each of the encoding nodes. Each encoding node stores an encoded symbol from the same field, as a function of the received symbols. However, some of the source nodes are controlled by the adversary and may send different symbols to different encoding nodes. Depending on the number of the adversarial nodes, denoted by $\beta \in \mathbb {N}$ , and the cardinality of the set of symbols that each one generates, denoted by $v \in \mathbb {N}$ , the process of decoding from the encoded symbols could be impossible. Assume that a decoder connects to an arbitrary subset of $t \in \mathbb {N}$ encoding nodes and wants to decode the symbols of the honest nodes correctly, without necessarily identifying the sets of honest and adversarial nodes. An important characteristic of a distributed encoding system is $t^{*} \in \mathbb {N}$ , the minimum of such $t$ , which is a function of $K$ , $N$ , $\beta $ , and $v$. In this paper, we study the distributed linear encoding system, i.e. one in which the encoding nodes use linear coding. We show that $t^{*}_{\textrm {Linear}}=K+2\beta (v-1)$ , if $N\ge K+2\beta (v-1)$ , and $t^{*}_{\textrm {Linear}}=N$ , if $N\le K+2\beta (v-1)$. In order to achieve $t^{*}_{\textrm {Linear}}$ , we use random linear coding and show that in any feasible solution that the decoder finds, the messages of the honest nodes are decoded correctly. In order to prove the converse of the fundamental limit, we show that when the adversary behaves in a particular way, it can always confuse the decoder between two feasible solutions that differ in the message of at least one honest node. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
6. On the Combinatorics of Locally Repairable Codes via Matroid Theory.
- Author
-
Westerback, Thomas, Freij-Hollanti, Ragnar, Ernvall, Toni, and Hollanti, Camilla
- Subjects
COMBINATORICS ,COMBINATORIAL probabilities ,COMBINATORIAL group theory ,MATROIDS ,LINEAR dependence (Mathematics) - Abstract
This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters $(n,k,d,r,\delta )$ of LRCs are generalized to matroids, and the matroid analog of the generalized singleton bound by Gopalan et al. for linear LRCs is given for matroids. It is shown that the given bound is not tight for certain classes of parameters, implying a nonexistence result for the corresponding locally repairable almost affine codes that are coined perfect in this paper. Constructions of classes of matroids with a large span of the parameters $(n,k,d,r,\delta )$ and the corresponding local repair sets are given. Using these matroid constructions, new LRCs are constructed with prescribed parameters. The existence results on linear LRCs and the nonexistence results on almost affine LRCs given in this paper strengthen the nonexistence and existence results on perfect linear LRCs given by Song et al. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
7. Almost Optimal Construction of Functional Batch Codes Using Extended Simplex Codes.
- Author
-
Yohananov, Lev and Yaakobi, Eitan
- Subjects
LINEAR codes ,INFORMATION retrieval ,LOGICAL prediction - Abstract
A functional $k$ -batch code of dimension $s$ consists of $n$ servers storing linear combinations of $s$ linearly independent information bits. Any multiset request of size $k$ of linear combinations (or requests) of the information bits can be recovered by $k$ disjoint subsets of the servers. The goal under this paradigm is to find the minimum number of servers for given values of $s$ and $k$. A recent conjecture states that for any $k=2^{s-1}$ requests the optimal solution requires $2^{s}-1$ servers. This conjecture is verified for $s \leqslant 5$ but previous work could only show that codes with $n=2^{s}-1$ servers can support a solution for $k=2^{s-2} + 2^{s-4} + \left \lfloor{ \frac { 2^{s/2}}{\sqrt {24}} }\right \rfloor $ requests. This paper reduces this gap and shows the existence of codes for $k=\lfloor \frac {5}{6}2^{s-1} \rfloor - s$ requests with the same number of servers. Another construction in the paper provides a code with $n=2^{s+1}-2$ servers and $k=2^{s}$ requests, which is an optimal result. These constructions are mainly based on extended Simplex codes and equivalently provide constructions for parallel Random I/O (RIO) codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences.
- Author
-
Liu, Qi, Ding, Cunsheng, Mesnager, Sihem, Tang, Chunming, and Tonchev, Vladimir D.
- Subjects
AUTOMORPHISM groups ,ALGEBRAIC coding theory ,REPRESENTATIONS of groups (Algebra) ,DATA transmission systems ,QUANTUM information science ,GROUP theory ,LINEAR codes ,CYCLIC codes - Abstract
The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass of cyclic codes that have found numerous applications in error correction and notably in quantum information processing. They are widely used in data storage and communication systems. A subclass of attractive BCH codes is the narrow-sense BCH codes over the Galois field ${\mathrm {GF}}(q)$ with length $q+1$ , which are closely related to the action of the projective general linear group of degree two on the projective line. Despite its interest, not much is known about this class of BCH codes. This paper aims to study some of the codes within this class and specifically narrow-sense antiprimitive BCH codes (these codes are also linear complementary duals (LCD) codes that have interesting practical recent applications in cryptography, among other benefits). We shall use tools and combine arguments from algebraic coding theory, combinatorial designs, and group theory (group actions, representation theory of finite groups, etc.) to investigate narrow-sense antiprimitive BCH Codes and extend results from the recent literature. Notably, the dimension, the minimum distance of some $q$ -ary BCH codes with length $q+1$ , and their duals are determined in this paper. The dual codes of the narrow-sense antiprimitive BCH codes derived in this paper include almost MDS codes. Furthermore, the classification of ${\mathrm {PGL}}(2, p^{m})$ -invariant codes over ${\mathrm {GF}}(p^{h})$ is completed. As an application of this result, the $p$ -ranks of all incidence structures invariant under the projective general linear group ${\mathrm {PGL}}(2, p^{m})$ are determined. Furthermore, infinite families of narrow-sense BCH codes admitting a 3-transitive automorphism group are obtained. Via these BCH codes, a coding-theory approach to constructing the Witt spherical geometry designs is presented. The BCH codes proposed in this paper are good candidates for permutation decoding, as they have a relatively large group of automorphisms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
9. Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes.
- Author
-
Jin, Lingfei
- Subjects
CIPHERS ,LINEAR codes ,CONSTRUCTION ,DISTANCES - Abstract
In a paper by Guruswami et al., it was shown that the length $n$ of a $q$ -ary linear locally recoverable code with distance $d \geqslant 5$ is upper bounded by $O(dq^{3})$. Thus, it is a challenging problem to construct $q$ -ary locally recoverable codes with distance $d \geqslant 5$ and length approaching the upper bound. The same paper also gave an algorithmic construction of $q$ -ary locally recoverable codes with locality $r$ and length $n=\Omega _{r}(q^{2})$ for $d=5$ and 6, where $\Omega _{r}$ means that the implicit constant depends on locality $r$. In this paper, we present an explicit construction of $q$ -ary locally recoverable codes of distance $d= 5$ and 6 via binary constant weight codes. It turns out that 1) our construction is simpler and more explicit and 2) the length of our codes is greater than previously known. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
10. Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes.
- Author
-
Wu, Yansheng and Yue, Qin
- Subjects
FACTORIZATION ,BINOMIAL equations ,LINEAR codes ,POLYNOMIALS ,MATHEMATICS theorems - Abstract
Constacyclic codes are well-known generalizations of cyclic and negacyclic codes. Due to their rich algebraic structure, constacyclic codes are used to construct quantum codes and symbol-pair codes. Let ${\mathbb {F}}_{q}$ be a finite field with order $q$ , where $q$ is a positive power of a prime $p$. Suppose that $n$ is a positive integer and the product of distinct prime factors of $n$ divides $q-1$ , i.e., $rad(n)\mid (q-1)$. In this paper, we explicitly factorize the polynomial $x^{n}-\lambda $ for each $\lambda \in {\mathbb {F}}_{q}^{*}$. As applications, first, we obtain all repeated-root $\lambda $ -constacyclic codes and their dual codes of length $np^{s}$ over ${\mathbb {F}}_{q}$ ; second, we determine all simple-root LCD cyclic codes and LCD negacyclic codes of length $n$ over ${\mathbb {F}}_{q}$ ; third, we list all self-dual repeated-root negacyclic codes of length $np^{s}$ over ${\mathbb {F}}_{q}$. In contrast to known results, the lengths of constacyclic codes in this paper have more flexible parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
11. Nearly Optimal Constructions of PIR and Batch Codes.
- Author
-
Asi, Hilal and Yaakobi, Eitan
- Subjects
ERROR-correcting codes ,INFORMATION retrieval ,MATHEMATICS theorems ,NUMERICAL analysis ,CODING theory - Abstract
In this paper, we study two families of codes with availability, namely, private information retrieval (PIR) codes and batch codes. While the former requires that every information symbol has $k$ mutually disjoint recovering sets, the latter imposes this property for each multiset request of $k$ information symbols. The main problem under this paradigm is to minimize the number of redundancy symbols. We denote this value by $r_{P}(n,k)$ and $r_{B}(n,k)$ , for PIR codes and batch codes, respectively, where $n$ is the number of information symbols. Previous results showed that for any constant $k$ , $r_{P}(n,k) = \Theta (\sqrt {n})$ and $r_{B}(n,k)= {\mathcal{ O}}(\sqrt {n}\log (n))$. In this paper, we study the asymptotic behavior of these codes for non-constant $k$ and specifically for $k=\Theta (n^\epsilon)$. We also study the largest value of $k$ such that the rate of the codes approaches 1 and show that for all $\epsilon < 1$ , $r_{P}(n,n^\epsilon) = o(n)$ and $r_{B}(n,n^\epsilon) = o(n)$. Furthermore, several more results are proved for the case of fixed $k$. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
12. A Joint Typicality Approach to Compute–Forward.
- Author
-
Lim, Sung Hoon, Feng, Chen, Pastore, Adriano, Nazer, Bobak, and Gastpar, Michael
- Subjects
INFORMATION technology ,TELEMATICS ,DATA transmission systems ,DIGITAL communications ,ELECTRONIC systems ,INFORMATION theory ,SIGNAL processing - Abstract
This paper presents a joint typicality framework for encoding and decoding nested linear codes in multi-user networks. This framework provides a new perspective on compute–forward within the context of discrete memoryless networks. In particular, it establishes an achievable rate region for computing a linear combination over a discrete memoryless multiple-access channel (MAC). When specialized to the Gaussian MAC, this rate region recovers and improves upon the lattice-based compute–forward rate region of Nazer and Gastpar, thus providing a unified approach for discrete memoryless and Gaussian networks. Furthermore, our framework provides some valuable insights on establishing the optimal decoding rate region for compute–forward by considering joint decoders, progressing beyond most previous works that consider successive cancellation decoding. Specifically, this paper establishes an achievable rate region for simultaneously decoding two linear combinations of nested linear codewords from $K$ senders. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
13. Distributed Linearly Separable Computation.
- Author
-
Wan, Kai, Sun, Hua, Ji, Mingyue, and Caire, Giuseppe
- Subjects
FINITE fields ,DISTRIBUTED computing ,LINEAR codes ,CHANNEL coding ,DISTRIBUTED algorithms - Abstract
This paper formulates a distributed computation problem, where a master asks ${\mathsf N}$ distributed workers to compute a linearly separable function. The task function can be expressed as ${\mathsf K}_{\mathrm{ c}}$ linear combinations of ${\mathsf K}$ messages, where each message is a function of one dataset. Our objective is to find the optimal tradeoff between the computation cost (number of uncoded datasets assigned to each worker) and the communication cost (number of symbols the master must download), such that from the answers of any ${\mathsf N}_{\mathrm{ r}}$ out of ${\mathsf N}$ workers the master can recover the task function with high probability, where the coefficients of the ${\mathsf K}_{\mathrm{ c}}$ linear combinations are uniformly i.i.d. over some large enough finite field. The formulated problem can be seen as a generalized version of some existing problems, such as distributed gradient coding and distributed linear transform. In this paper, we consider the specific case where the computation cost is minimum, and propose novel achievability schemes and converse bounds for the optimal communication cost. Achievability and converse bounds coincide for some system parameters; when they do not match, we prove that the achievable distributed computing scheme is optimal under the constraint of a widely used ‘cyclic assignment’ scheme on the datasets. Our results also show that when ${\mathsf K}= {\mathsf N}$ , with the same communication cost as the optimal distributed gradient coding scheme proposed by Tandon et al. from which the master recovers one linear combination of ${\mathsf K}$ messages, our proposed scheme can let the master recover any additional ${\mathsf N}_{\mathrm{ r}}-1$ independent linear combinations of messages with high probability. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. Zero-Difference Balanced Functions With New Parameters and Their Applications.
- Author
-
Cai, Han, Tang, Xiaohu, Zhou, Zhengchun, and Miao, Ying
- Subjects
BOOLEAN functions ,CYCLOTOMY ,LINEAR codes ,SETS of pairs of functions to be distinguished ,ABELIAN groups - Abstract
As an optimal combinatorial object, zero-difference balanced (ZDB) functions introduced by Ding in 2008, are a generalization of the well-known perfect nonlinear functions. ZDB functions have received much attention in recent years due to its important applications in coding theory and sequence design. One objective of this paper is to present a construction of ZDB functions based on a kind of generalized cyclotomy. It generates ZDB functions over cyclic group with new parameters which can not be produced by earlier constructions. Another objective of this paper is to employ these ZDB functions to obtain at the same time: 1) optimal constant-composition codes; 2) perfect difference systems of sets; and 3) optimal frequency-hopping sequences, all with new parameters. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
15. Linear Codes From Some 2-Designs.
- Author
-
Ding, Cunsheng
- Subjects
LINEAR codes ,INCIDENCE functions ,INFORMATION sharing ,HOUSEHOLD electronics ,INFORMATION storage & retrieval systems ,BOOLEAN functions - Abstract
A classical method of constructing a linear code over \mathrm GF(q) with a $t$ -design is to use the incidence matrix of the $t$ -design as a generator matrix over \mathrm GF(q) of the code. This approach has been extensively investigated in the literature. In this paper, a different method of constructing linear codes using specific classes of 2-designs is studied, and linear codes with a few weights are obtained from almost difference sets, difference sets, and a type of 2-designs associated to semibent functions. Two families of the codes obtained in this paper are optimal. The linear codes presented in this paper have applications in secret sharing and authentication schemes, in addition to their applications in consumer electronics, communication and data storage systems. A coding-theory approach to the characterization of highly nonlinear Boolean functions is presented. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
16. Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding.
- Author
-
Yu, Qian, Maddah-Ali, Mohammad Ali, and Avestimehr, A. Salman
- Subjects
MATRIX multiplications ,FAULT-tolerant computing ,LINEAR codes ,BILINEAR forms ,PROTHROMBIN ,CIPHERS - Abstract
We consider the problem of massive matrix multiplication, which underlies many data analytic applications, in a large-scale distributed system comprising a group of worker nodes. We target the stragglers’ delay performance bottleneck, which is due to the unpredictable latency in waiting for slowest nodes (or stragglers) to finish their tasks. We propose a novel coding strategy, named entangled polynomial code, for designing the intermediate computations at the worker nodes in order to minimize the recovery threshold (i.e., the number of workers that we need to wait for in order to compute the final output). We demonstrate the optimality of entangled polynomial code in several cases, and show that it provides orderwise improvement over the conventional schemes for straggler mitigation. Furthermore, we characterize the optimal recovery threshold among all linear coding strategies within a factor of 2 using bilinear complexity, by developing an improved version of the entangled polynomial code. In particular, while evaluating bilinear complexity is a well-known challenging problem, we show that optimal recovery threshold for linear coding strategies can be approximated within a factor of 2 of this fundamental quantity. On the other hand, the improved version of the entangled polynomial code enables further and orderwise reduction in the recovery threshold, compared to its basic version. Finally, we show that the techniques developed in this paper can also be extended to several other problems such as coded convolution and fault-tolerant computing, leading to tight characterizations. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
17. A Novel Application of Boolean Functions With High Algebraic Immunity in Minimal Codes.
- Author
-
Chen, Hang, Ding, Cunsheng, Mesnager, Sihem, and Tang, Chunming
- Subjects
BOOLEAN functions ,ALGEBRAIC functions ,REED-Muller codes ,LINEAR codes ,BINARY codes ,CODING theory - Abstract
Boolean functions with high algebraic immunity are important cryptographic primitives in some stream ciphers. In this paper, two methodologies for constructing minimal binary codes from sets, Boolean functions and vectorial Boolean functions with high algebraic immunity, are proposed. More precisely, a general construction of new minimal codes using minimal codes contained in Reed-Muller codes and sets without nonzero low degree annihilators is presented. The other construction allows us to yield minimal codes from certain subcodes of Reed-Muller codes and vectorial Boolean functions with high algebraic immunity. Via these general constructions, infinite families of minimal binary linear codes of dimension $m$ and length less than or equal to $m(m+1)/2$ are obtained. Besides, a lower bound on the minimum distance of the proposed minimal linear codes is established. Conjectures and open problems are also presented. The results of this paper show that Boolean functions with high algebraic immunity have nice applications in several fields additionally to symmetric cryptography, such as coding theory and secret sharing schemes. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
18. Some Punctured Codes of Several Families of Binary Linear Codes.
- Author
-
Wang, Xiaoqiang, Zheng, Dabin, and Ding, Cunsheng
- Subjects
BINARY codes ,LINEAR codes ,BENT functions ,FINITE fields ,BOOLEAN functions ,FAMILIES - Abstract
Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by C(ƒ) = {Tr(aƒ(x) + bx)
x∈Fqm *: a, b ∈ Fqm }, where q is a prime power, Fqm * = Fqm \ {0}, Tr is the trace function from Fqm to Fq , and ƒ(x) is a function from Fqm to Fqm with ƒ(0) = 0. Almost bent functions, quadratic functions and some monomials on F2m were used in the first construction, and many families of binary linear codes with few weights were obtained in the literature. This paper studies some punctured codes of these binary codes. Several families of binary linear codes with few weights and new parameters are obtained in this paper. Several families of distance-optimal binary linear codes with new parameters are also produced in this paper. [ABSTRACT FROM AUTHOR]- Published
- 2021
- Full Text
- View/download PDF
19. Shortened Linear Codes Over Finite Fields.
- Author
-
Liu, Yang, Ding, Cunsheng, and Tang, Chunming
- Subjects
LINEAR codes ,REED-Muller codes ,HAMMING codes ,HAMMING weight ,FINITE fields ,RESEARCH methodology ,CYCLIC codes - Abstract
The puncturing and shortening techniques are two important approaches to constructing new linear codes from old ones. In the past 70 years, a lot of progress on the puncturing technique has been made, and many works on punctured linear codes have been done. Many families of linear codes with interesting parameters have been obtained with the puncturing technique. However, little research on the shortening technique has been done and there are only a handful references on shortened linear codes. The first objective of this paper is to prove some general theory for shortened linear codes. The second objective is to study some shortened codes of the Hamming codes, Simplex codes, some Reed-Muller codes, and ovoid codes. Eleven families of optimal shortened codes over finite fields are presented in this paper. As a byproduct, five infinite families of 2-designs are also constructed from some of the shortened codes presented in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
20. Binary Linear Codes With Few Weights From Two-to-One Functions.
- Author
-
Li, Kangquan, Li, Chunlei, Helleseth, Tor, and Qu, Longjiang
- Subjects
BINARY codes ,LINEAR codes ,SPHERE packings ,HAMMING weight - Abstract
In this paper, we apply two-to-one functions over F
2n in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) (x2t + x)e with gcd (t, n) = gcd(e, 2n−1 ) = 1. Based on the study of the Walsh transforms of those functions or their variants, we present many classes of linear codes with few nonzero weights, including one weight, three weights, four weights, and five weights. The weight distributions of the proposed codes with one weight and with three weights are determined. In addition, we discuss the minimum distance of the dual of the constructed codes and show that some of them achieve the sphere packing bound. Moreover, examples show that some codes in this paper have best-known parameters. [ABSTRACT FROM AUTHOR]- Published
- 2021
- Full Text
- View/download PDF
21. A Galois Connection Approach to Wei-Type Duality Theorems.
- Author
-
Xu, Yang, Kan, Haibin, and Han, Guangyue
- Subjects
LINEAR codes ,HAMMING weight ,MATROIDS - Abstract
In 1991, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei’s duality theorem has since been extensively studied from different perspectives and extended to other settings. In this paper, we re-examine Wei’s duality theorem and its various extensions, henceforth referred to as Wei-type duality theorems, from a new Galois connection perspective. Our approach is based on the observation that the generalized Hamming weights and the dimension/length profiles of a linear code form a Galois connection. The central result of this paper is a general Wei-type duality theorem for two Galois connections between finite subsets of $\mathbb {Z}$ , from which all the known Wei-type duality theorems can be recovered. As corollaries of our central result, we prove new Wei-type duality theorems for $w$ -demi-matroids defined over finite sets and $w$ -demi-polymatroids defined over modules with a composition series, which further allows us to unify and generalize all the known Wei-type duality theorems established for codes endowed with various metrics. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
22. Enumeration of Extended Irreducible Binary Goppa Codes.
- Author
-
Chen, Bocong and Zhang, Guanghui
- Subjects
BINARY codes ,LINEAR codes ,PRIME numbers ,ODD numbers ,CRYPTOSYSTEMS - Abstract
The family of Goppa codes is one of the most interesting subclasses of linear codes. As the McEliece cryptosystem often chooses a random Goppa code as its key, knowledge of the number of inequivalent Goppa codes for fixed parameters may facilitate in the evaluation of the security of such a cryptosystem. In this paper we present a new approach to give an upper bound on the number of inequivalent extended irreducible binary Goppa codes. To be more specific, let $n>3$ be an odd prime number and $q=2^{n}$ ; let $r\geq 3$ be a positive integer satisfying $\gcd (r,n)=1$ and $\gcd \big (r,q(q^{2}-1)\big)=1$. We obtain an upper bound for the number of inequivalent extended irreducible binary Goppa codes of length $q+1$ and degree $r$. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
23. Constructions of Linear Codes With One-Dimensional Hull.
- Author
-
Li, Chengju and Zeng, Peng
- Subjects
LINEAR codes ,CYCLIC codes ,AUTOMORPHISMS ,POLYNOMIALS ,ABELIAN groups - Abstract
The hull of a linear code is defined to be the intersection of the code and its dual, and was originally introduced to classify finite projective planes. The hull plays an important role in determining the complexity of algorithms for checking permutation equivalence of two linear codes and computing the automorphism group of a linear code. It has been shown that these algorithms are very effective in general if the size of the hull is small. The objective of this paper is to present some sufficient and necessary conditions that linear codes and cyclic codes have one-dimensional hull. It is shown that there are no such binary or ternary cyclic codes. Based on these characterizations, some constructions of linear codes with one-dimensional hull were given by employing quadratic number fields, partial difference sets, and difference sets. We also construct cyclic codes with one-dimensional hull. Some optimal codes with one-dimensional hull are obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
24. On the Covering Radius of Small Codes Versus Dual Distance.
- Author
-
Bazzi, Louay
- Subjects
LINEAR codes ,RADIAL bone ,CORPORATE distributions ,THETA series ,AUTHORS - Abstract
Tietäväinen’s upper and lower bounds assert that for block-length- $n$ linear codes with dual distance $d$ , the covering radius $R$ is at most $({n}/{2})-(({1}/{2})-o(1))\sqrt {dn}$ and typically at least $({n}/{2})-\Theta (({dn\log {({n}/{d})}})^{1/2})$. The gap between those bounds on $R -({n}/{2})$ is a $\Theta (({\log {({n}/{d})}})^{1/2})$ factor related to the gap between the worst covering radius given $d$ and the sphere-covering bound. Our focus in this paper is on the case when $d = o(n)$ , i.e., when the code size is subexponential and the gap is $w(1)$. We show that up to a constant, the gap can be eliminated by relaxing the covering requirement to allow for missing $o(1)$ fraction of points. Namely, if the dual distance $d = o(n)$ , then for sufficiently large $d$ , almost all points can be covered with radius $R\leq ({n}/{2})-\Theta (({dn\log {({n}/{d})}})^{1/2})$. Compared with random linear codes, our bound on $R-({n}/{2})$ is asymptotically tight up to a factor less than 3. We give applications to dual-BCH codes. The proof builds on the author’s previous work on the weight distribution of cosets of linear codes, which we simplify in this paper and extend from codes to probability distributions on $\{0,1\}^{n}$ , thus enabling the extension of the earlier result to $(d-1)$ -wise independent distributions. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
25. Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction.
- Author
-
Zhou, Zhengchun, Li, Xia, Tang, Chunming, and Ding, Cunsheng
- Subjects
LINEAR codes ,INJECTIONS ,POLYNOMIALS ,BINARY codes ,GENERIC drugs - Abstract
Linear codes with certain special properties have received renewed attention in recent years due to their practical applications. Among them, binary linear complementary dual (LCD) codes play an important role in implementations against side-channel attacks and fault injection attacks. Self-orthogonal codes can be used to construct quantum codes. In this paper, four classes of binary linear codes are constructed via a generic construction which has been intensively investigated in the past decade. Simple characterizations of these linear codes to be LCD or self-orthogonal are presented. Resultantly, infinite families of binary LCD codes and self-orthogonal codes are obtained. Infinite families of binary LCD codes from the duals of these four classes of linear codes are produced. Many LCD codes and self-orthogonal codes obtained in this paper are optimal or almost optimal in the sense that they meet certain bounds on general linear codes. In addition, the weight distributions of two sub-families of the proposed linear codes are established in terms of Krawtchouk polynomials. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
26. LCD Cyclic Codes Over Finite Fields.
- Author
-
Li, Chengju, Ding, Cunsheng, and Li, Shuxing
- Subjects
BCH codes ,CYCLIC codes ,FINITE fields ,CYCLOTOMIC fields ,LINEAR programming - Abstract
In addition to their applications in data storage, communications systems, and consumer electronics, linear complementary dual (LCD) codes—a class of linear codes—have been employed in cryptography recently. LCD cyclic codes were referred to as reversible cyclic codes in the literature. The objective of this paper is to construct several families of reversible cyclic codes over finite fields and analyze their parameters. The LCD cyclic codes presented in this paper have very good parameters in general, and contain many optimal codes. A well rounded treatment of reversible cyclic codes is also given in this paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
27. Infinite Families of Linear Codes Supporting More t -Designs.
- Author
-
Yan, Qianqian and Zhou, Junling
- Subjects
AUTOMORPHISM groups ,CYBERNETICS ,AUTOMORPHISMS ,LINEAR codes - Abstract
Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of BCH codes $\mathcal {C}_{(q,q+1,4,1)}$ and their dual codes with $q=2^{m}$ and established that the codewords of the minimum (or the second minimum) weight in these codes support 4-designs or 3-designs. Motivated by this, we further investigate the codewords of the next adjacent weight in such codes and discover more infinite classes of $t$ -designs with $t=3,4$. In particular, we prove that codewords of weight 7 in $\mathcal {C}_{(q,q+1,4,1)}$ support 4-designs for odd $m \geqslant 5$ and they support 3-designs for even $m \geqslant 4$ , which provide infinite classes of simple $t$ -designs with new parameters. Another significant class of $t$ -designs we produce in this paper has complementary designs with parameters 4- $(2^{2s+1}+ 1,5,5)$ ; these designs have the smallest index among all the known simple 4- $(q+1,5,\lambda)$ designs derived from codes for prime powers $q$ ; and they are further proved to be isomorphic to the 4-designs admitting the projective general linear group PGL $(2,2^{2s+1})$ as the automorphism group constructed by Alltop in 1969. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. Convertible Codes: Enabling Efficient Conversion of Coded Data in Distributed Storage.
- Author
-
Maturana, Francisco and Rashmi, K. V.
- Subjects
DATA warehousing ,DATA conversion ,CODING theory ,LINEAR codes ,ELECTRONIC data processing - Abstract
Erasure codes are essential for providing efficient resilience against node failures in distributed storage. Typically, an $[n, k]$ erasure code encodes $k$ symbols into $n$ symbols which are then stored in different nodes. Recent work by Kadekodi et al. shows that the failure rates of storage nodes vary significantly over time, and that changing the rate of the code (via a change in $n$ and $k$) in response to such variations provides substantial storage space savings. However, the resource overhead of re-encoding the already encoded data is prohibitively high. We present a new theoretical framework formalizing code conversion—the process of converting data encoded with an $[n^{ I}, k^{ I}]$ code into data encoded with an $[{n^{ F}}, {k^{ F}}]$ code while maintaining desired decodability properties. We then introduce convertible codes, a new class of codes that allow for code conversions in a resource-efficient manner. This paper begins the study on convertible codes by focusing on linear MDS codes and the access cost of conversion. We derive a lower bound on the access cost of conversion and present an explicit optimal construction matching this bound for an important subclass of conversions. Additionally, we propose constructions with low field-size requirement for a broad subset of parameters. Our results show that it is possible to achieve code conversions with significantly less resources than the default approach of re-encoding for a wide range of parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
29. On Linear Codes With One-Dimensional Euclidean Hull and Their Applications to EAQECCs.
- Subjects
LINEAR codes ,ALGEBRAIC codes ,AUTOMORPHISM groups ,ALGEBRAIC geometry ,ERROR-correcting codes ,LIQUID crystal displays - Abstract
The Euclidean hull of a linear code $C$ is the intersection of $C$ with its Euclidean dual $C^\perp $. The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing the automorphism group of a linear code and for checking permutation equivalence of two linear codes. The Euclidean hull of a linear code has been applied to the so-called entanglement-assisted quantum error-correcting codes (EAQECCs) via classical error-correcting codes. In this paper, we firstly consider linear codes with one-dimensional Euclidean hull from algebraic geometry codes, and then present a general method to construct linear codes with arbitrary dimensional Euclidean hull. Some new EAQECCs are presented. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
30. The Subfield Codes of Some [ q + 1, 2, q ] MDS Codes.
- Author
-
Heng, Ziling and Ding, Cunsheng
- Subjects
FINITE fields ,HAMMING weight ,LINEAR codes - Abstract
Recently, subfield codes of geometric codes over large finite fields ${\mathrm {GF}}(q)$ with dimension 3 and 4 were studied and distance-optimal subfield codes over ${\mathrm {GF}}(p)$ were obtained, where $q=p^{m}$. The key idea for obtaining very good subfield codes over small fields is to choose very good linear codes over an extension field with small dimension. This paper first presents a general construction of $[q+1, 2, q]$ MDS codes over ${\mathrm {GF}}(q)$ , and then studies the subfield codes over ${\mathrm {GF}}(p)$ of some of the $[q+1, 2,q]$ MDS codes over ${\mathrm {GF}}(q)$. Two families of dimension-optimal codes over ${\mathrm {GF}}(p)$ are obtained, and several families of nearly optimal codes over ${\mathrm {GF}}(p)$ are produced. Several open problems are also proposed in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
31. Base Field Extension of AG Codes for Decoding.
- Subjects
DECODING algorithms ,ALGEBRAIC curves ,LINEAR algebra ,LINEAR codes ,ALGEBRAIC codes ,ALGEBRAIC geometry - Abstract
Previous algorithms for decoding AG codes up to the designed distance all assumed existence of an extra rational place on the base algebraic curve. The place is used to solve the decoding problem by linear algebra over the base field of the curve. The rationality of the place is essential, and therefore AG codes supported by all rational places on the curve are excluded from the domain of applicability of the decoding algorithms. This paper presents a decoding algorithm for those AG codes using an extra place of higher degree. Hence finally all AG codes, as Goppa defined 40 years ago, are equipped with a fast decoding algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
32. Shortened Linear Codes From APN and PN Functions.
- Author
-
Xiang, Can, Tang, Chunming, and Ding, Cunsheng
- Subjects
LINEAR codes ,BINARY codes ,CODING theory ,REED-Muller codes ,GENERATING functions ,NONLINEAR functions - Abstract
Linear codes generated by component functions of perfect nonlinear (PN for short) and almost perfect nonlinear (APN for short) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper is to investigate some binary shortened codes of two families of linear codes from APN functions and some $p$ -ary shortened codes associated with PN functions. The weight distributions of these shortened codes and the parameters of their duals are determined. The parameters of these binary codes and $p$ -ary codes are flexible. Many of the codes presented in this paper are optimal or almost optimal. The results of this paper show that the shortening technique is very promising for constructing good codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
33. Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions.
- Author
-
Chen, Bocong and Zhang, Guanghui
- Subjects
REED-Solomon codes ,HAMMING distance ,REED-Muller codes ,LINEAR codes - Abstract
Insertion–deletion codes (insdel codes for short) play an important role in synchronization error correction. The higher the minimum insdel distance, the more insdel errors the code can correct. Haeupler and Shahrasbi established the Singleton bound for insdel codes: the minimum insdel distance of any $[n,k]$ linear code over $\mathbb {F}_{q}$ satisfies $d\leq 2n-2k+2$. There have been some constructions of insdel codes through Reed-Solomon codes with high capabilities, but none has come close to this bound. Recently, Do Duc et al. showed that the minimum insdel distance of any $[n,k]$ Reed-Solomon code is no more than $2n-2k$ if $q$ is large enough compared to the code length $n$ ; optimal codes that meet the new bound were also constructed explicitly. The contribution of this paper is twofold. We first show that the minimum insdel distance of any $[n,k]$ linear code over $\mathbb {F}_{q}$ satisfies $d\leq 2n-2k$ if $n > k > 1$. This result improves and generalizes the previously known results in the literature. We then give a sufficient condition under which the minimum insdel distance of a 2-D Reed-Solomon code of length $n$ over $\mathbb {F}_{q}$ is exactly equal to $2n-4$. As a consequence, we show that the sufficient condition is not hard to achieve; we explicitly construct an infinite family of optimal 2-D Reed-Somolom codes meeting the bound. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
34. Two or Three Weight Linear Codes From Non-Weakly Regular Bent Functions.
- Author
-
Ozbudak, Ferruh and Pelen, Rumi Melih
- Subjects
BENT functions ,LINEAR codes ,CODING theory ,FINITE fields ,DATA warehousing - Abstract
Linear codes with few weights have applications in consumer electronics, communications, data storage systems, secret sharing, authentication codes, and association schemes. As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure computation of data between two parties. The construction of minimal linear codes with new and desirable parameters is an interesting research topic in coding theory and cryptography. Recently, Mesnager et.al. stated that “constructing linear codes with good parameters from non-weakly regular bent functions is an interesting problem.” The goal of this paper is to construct linear codes with two or three weights from non-weakly regular bent functions over finite fields and analyze the minimality of the constructed linear codes. In doing so, we draw inspiration from a paper by Mesnager in which she constructed linear codes with small weights from weakly regular bent functions based on a generic construction method. First, we recall the definitions of the subsets $B_{+}(f)$ and $B_{-}(f)$ associated with a non-weakly regular bent function $f$. Next, we construct two- or three-weight linear $p$ -ary codes on these sets using duals of the non-weakly regular bent functions that are also bent. We note that the constructed linear codes are minimal in almost all cases. Moreover, when $f$ is a non-weakly regular bent function in a certain subclass of Generalized Maiorana-McFarland bent functions, we determine the weight distributions of the corresponding linear codes. As far as we know, the construction of linear codes from non-weakly regular bent functions over finite fields is first studied in the literature by the second author in his dissertation. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
35. Two Families of Optimal Linear Codes and Their Subfield Codes.
- Author
-
Heng, Ziling, Wang, Qiuyan, and Ding, Cunsheng
- Subjects
LINEAR codes ,CYCLIC codes ,FAMILIES - Abstract
In this paper, a family of $[{q}^{2}-1, 4, {q}^{2}-{q}-2]$ cyclic codes over ${\mathbb F}_{{q}}$ meeting the Griesmer bound is presented. Their duals are $[{q}^{2}-1,{q}^{2}-5,4]$ almost MDS codes and are optimal with respect to the sphere-packing bound. The ${q}_{0}$ -ary subfield codes of this family of cyclic codes are also investigated, where ${q}_{0}$ is any prime power such that q is power of ${q}_{0}$. Some of the subfield codes are optimal and some have the best known parameters. It is shown that the subfield codes are equivalent to a family of primitive BCH codes and thus the parameters of the BCH codes are solved. The duals of the subfield codes are also optimal with respect to the sphere-packing bound. A family of $[{q}^{2}, 4, {q}^{2}-{q}-1]$ linear codes over ${\mathbb F}_{{q}}$ meeting the Griesmer bound is presented. Their duals are $[{q}^{2},{q}^{2}-4,4]$ almost MDS codes and are optimal with respect to the sphere-packing bound. The ${q}_{0}$ -ary subfield codes of this family of linear codes are also investigated, where ${q}_{0}$ is any prime power such that q is power of ${q}_{0}$. Five infinite families of 2-designs are also constructed with three families of linear codes of this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
36. New Optimal Cyclic Locally Recoverable Codes of Length $n=2(q+1)$.
- Author
-
Qian, Jianfa and Zhang, Lina
- Abstract
Locally recoverable codes are very important due to their applications in distributed storage systems. In this paper, by using cyclic codes, we construct two classes of optimal q-ary cyclic $(\text {r}, \delta _{1})$ locally recoverable codes with parameters $[2(\text {q}+1), 2(\text {q}+1)-2\delta _{1}, \delta _{1}+2]_{\text {q}}$ , where $q$ is an odd prime power and $\text {r}+\delta _{1}-1=\text {q}+1$ , and $(\text {r}, \delta _{2})$ locally recoverable codes with parameters $[2(\text {q}+1), 2(\text {q}+1)-4\delta _{2}+2, \delta _{2}+2]_{q}$ , where $\text {q}\geq 7$ is an odd prime power, $\text {q}\equiv 3~ (mod~ 4)$ and $r+\delta _{2}-1=\frac {\text {q}+1}{2}$. Compared with the known cyclic and constacyclic $(\text {r}, \delta)$ locally recoverable codes, our construction yields new optimal cyclic $(\text {r}, \delta)$ locally recoverable codes. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
37. Linear Codes With Two or Three Weights From Weakly Regular Bent Functions.
- Author
-
Tang, Chunming, Li, Nian, Qi, Yanfeng, Zhou, Zhengchun, and Helleseth, Tor
- Subjects
LINEAR codes ,BENT functions ,INFORMATION sharing ,REGULAR graphs ,CYCLOTOMIC fields ,HOUSEHOLD electronics ,INFORMATION theory - Abstract
Linear codes with a few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of constructing two-weight and three-weight linear codes of Ding et al. and Zhou et al. to general weakly regular bent functions and determines the weight distributions of these linear codes. It solves an open problem proposed by Ding et al. Furthermore, this paper constructs new linear codes with two or three weights and presents their weight distributions. They contain some optimal codes meeting certain bound on linear codes. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
38. Codes With Locality for Two Erasures.
- Author
-
Prakash, N., Lalitha, V., Balaji, S. B., and Vijay Kumar, P.
- Subjects
HAMMING weight ,REGULAR graphs ,CIPHERS ,ERROR-correcting codes ,LINEAR codes - Abstract
Codes with locality are a class of codes introduced by Gopalan et al. to efficiently repair a failed node, by minimizing the number of nodes contacted during repair. An $[n,k]$ systematic code is said to have information locality $r$ , if each message symbol can be recovered by accessing $\leq r$ other symbols. An $[n,k]$ code is said to have all-symbol locality $r$ , if each code symbol can be recovered by accessing $\leq r$ other symbols. In this paper, we consider a generalization of codes with all-symbol locality to the case of handling two erasures. We study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. We refer to these codes as sequential-recovery locally repairable codes (denoted by 2-seq LR codes). Earlier approaches to handling multiple erasures considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. We derive an upper bound on the rate of 2-seq LR codes. We provide constructions based on regular graphs which are rate-optimal with respect to the derived bound. We also characterize the structure of any rate-optimal code. By studying the Generalized Hamming Weights of the dual code, we derive a recursive upper bound on the minimum distance of 2-seq LR codes. We also provide constructions of a family of codes based on Turán graphs, that are optimal with respect to this bound. We also present explicit distance-optimal Turán graph based constructions of 2-seq LR codes for certain parameters. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
39. Decoding of Dual-Containing Codes From Hermitian Tower and Applications.
- Author
-
Jin, Lingfei and Kan, Haibin
- Subjects
DECODING algorithms ,HERMITIAN structures ,FIELD extensions (Mathematics) ,MONTE Carlo method ,ALGEBRAIC geometry ,ERROR-correcting codes - Abstract
In this paper, we study the decoding of dual-containing codes from Hermitian tower and applications to quantum codes. The contribution of this paper is threefold. First, we construct the quantum stabilizer codes from the Hermitian tower. Second, we provide a deterministic decoding algorithm with decoding radius that almost achieves the optimal decoding radius, i.e., $(1-R)/4$ , where $R$ is the rate. Last and most importantly, we present a Monte Carlo algorithm with decoding radius roughly equal to $(1-R)/3$ , which is beyond the optimal decoding radius $(1-R)/4$ . There are several features in this paper. First of all, we employ a differential for the Hermitian tower. This differential plays a crucial role for decoding. We also extend our decoding by passing to the constant field extension. This constant field extension makes the decoding work perfectly. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
40. A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing.
- Author
-
Ding, Kelan and Ding, Cunsheng
- Subjects
LINEAR codes ,DISTRIBUTION (Probability theory) ,HAMMING weight ,FINITE fields ,GAUSSIAN distribution ,GAUSSIAN sums ,CODING theory - Abstract
In this paper, a class of two-weight and three-weight linear codes over \mathrm 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 bounds on linear codes. These codes have applications also in authentication codes, association schemes, and strongly regular graphs, in addition to their applications in consumer electronics, communication and data storage systems. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
41. MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth.
- Author
-
Rawat, Ankit Singh, Tamo, Itzhak, Guruswami, Venkatesan, and Efremenko, Klim
- Subjects
CODING theory ,STORAGE area networks (Computer networks) ,MATHEMATICAL bounds ,DATA packeting ,BANDWIDTHS - Abstract
This paper addresses the problem of constructing maximum distance separable (MDS) codes that enable exact reconstruction (repair) of each code block by downloading a small amount of information from the remaining code blocks. The total amount of information flow from the remaining code blocks during this reconstruction process is referred to as repair bandwidth of the underlying code. Existing constructions of exact-repairable MDS codes with optimal repair bandwidth require working with large subpacketization levels, which restrict their applicability in practice. This paper presents two general approaches to construct exact-repairable MDS codes that aim at significantly reducing the required subpacketization level at the cost of slightly suboptimal repair bandwidth. The first approach provides MDS codes that have repair bandwidth at most twice the optimal repair bandwidth. In addition, these codes also have the smallest possible subpacketization level $O(r)$ , where $r$ denotes the number of parity blocks. This approach is then generalized to design codes that have their repair bandwidth approaching the optimal repair bandwidth at the cost of graceful increment in the required subpacketization level. The second approach transforms an MDS code with optimal repair bandwidth and large subpacketization level into a longer MDS code with small subpacketization level and near-optimal repair bandwidth. For a given $r$ , the codes constructed using this approach have their subpacketization level scaling logarithmically with the code length. In addition, the obtained codes require field size only linear in the code length and ensure load balancing among the intact code blocks in terms of the information downloaded from these blocks during the exact reconstruction of a code block. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
42. Weak Flip Codes and their Optimality on the Binary Erasure Channel.
- Author
-
Lin, Hsuan-Yin, Moser, Stefan M., and Chen, Po-Ning
- Subjects
BINARY erasure channels (Telecommunications) ,CODING theory ,MAXIMUM likelihood decoding ,ERROR probability ,HAMMING distance - Abstract
This paper investigates fundamental properties of nonlinear binary codes by looking at the codebook matrix not row-wise (codewords), but column-wise. The family of weak flip codes is presented and shown to contain many beautiful properties. In particular the subfamily fair weak flip codes, which goes back to Shannon et al. and which was shown to achieve the error exponent with a fixed number of codewords $\mathsf {M}$ , can be seen as a generalization of linear codes to an arbitrary number of codewords. The fair weak flip codes are related to binary nonlinear Hadamard codes. Based on the column-wise approach to the codebook matrix, the $r$ -wise Hamming distance is introduced as a generalization to the well-known and widely used (pairwise) Hamming distance. It is shown that the minimum $r$ -wise Hamming distance satisfies a generalized $r$ -wise Plotkin bound. The $r$ -wise Hamming distance structure of the nonlinear fair weak flip codes is analyzed and shown to be superior to many codes. In particular, it is proven that the fair weak flip codes achieve the $r$ -wise Plotkin bound with equality for all $r$. In the second part of this paper, these insights are applied to a binary erasure channel with an arbitrary erasure probability 0 < $\delta$ < 1. An exact formula for the average error probability of an arbitrary (linear or nonlinear) code using maximum likelihood decoding is derived and shown to be expressible using only the $r$ -wise Hamming distance structure of the code. For a number of codewords $\mathsf {M}$ satisfying $\mathsf {M}\le 4$ and an arbitrary finite blocklength $n$ , the globally optimal codes (in the sense of minimizing the average error probability) are found. For $\mathsf {M}$ = 5 or $\mathsf {M}$ = 6 and an arbitrary finite blocklength $n$ , the optimal codes are conjectured. For larger $\mathsf {M}$ , observations regarding the optimal design are presented, e.g., that good codes have a large $r$ -wise Hamming distance structure for all $r$. Numerical results validate our code design criteria and show the superiority of our best found nonlinear weak flip codes compared with the best linear codes. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
43. Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks.
- Author
-
Martinez-Penas, Umberto and Matsumoto, Ryutaroh
- Subjects
LINEAR network coding ,TWO-dimensional bar codes ,PARAMETERS (Statistics) ,WEIGHT measurement ,HAMMING weight ,LINEAR codes - Abstract
Universal security over a network with linear network coding has been intensively studied. However, previous linear codes and code pairs used for this purpose were linear over a larger field than that used on the network, which restricts the possible packet lengths of optimal universal secure codes, does not allow to apply known list-decodable rank-metric codes and requires performing operations over a large field. In this paper, we introduce new parameters (relative generalized matrix weights and relative dimension/rank support profile) for code pairs that are linear over the field used in the network, and show that they measure the universal security performance of these code pairs. For one code and non-square matrices, generalized matrix weights coincide with the existing Delsarte generalized weights, hence we prove the connection between these latter weights and secure network coding, which was left open. As main applications, the proposed new parameters enable us to: 1) obtain optimal universal secure linear codes on noiseless networks for all possible packet lengths, in particular for packet lengths not considered before, 2) obtain the first universal secure list-decodable rank-metric code pairs with polynomial-sized lists, based on a recent construction by Guruswami et al; and 3) obtain new characterizations of security equivalences of linear codes. Finally, we show that our parameters extend relative generalized Hamming weights and relative dimension/length profile, respectively, and relative generalized rank weights and relative dimension/intersection profile, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
44. Complementary Dual Algebraic Geometry Codes.
- Author
-
Mesnager, Sihem, Tang, Chunming, and Qi, Yanfeng
- Subjects
ALGEBRAIC geometric codes ,INFORMATION storage & retrieval systems ,LINEAR codes ,LIQUID crystal displays ,HOUSEHOLD electronics ,ELLIPTIC curves - Abstract
Linear complementary dual (LCD) codes are a class of linear codes introduced by Massey in 1964. LCD codes have been extensively studied in literature recently. In addition to their applications in data storage, communications systems, and consumer electronics, LCD codes have been employed in cryptography. More specifically, it has been shown that LCD codes can also help improve the security of the information processed by sensitive devices, especially against so-called side-channel attacks (SCA) and fault non-invasive attacks. In this paper, we are interested in the construction of particular algebraic geometry LCD codes which could be good candidates to be resistant against SCA. We firstly provide a construction scheme for obtaining LCD codes from any algebraic curve. Then, some explicit LCD codes from elliptic curves are presented. Maximum distance separable (MDS) codes are of the most importance in coding theory due to their theoretical significance and practical interests. In this paper, all the constructed LCD codes from elliptic curves are MDS or almost MDS. Some infinite classes of LCD codes from elliptic curves are optimal due to the Griesmer bound. Finally, we also derive some explicit LCD codes from hyperelliptic curves and Hermitian curves. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
45. Constructions of Optimal Cyclic (r,\delta ) Locally Repairable Codes.
- Author
-
Chen, Bin, Xia, Shu-Tao, Hao, Jie, and Fu, Fang-Wei
- Subjects
LINEAR codes ,SINGLETON bounds ,FINITE fields ,REED-Solomon codes ,COORDINATES - Abstract
A code is said to be an $r$ -local locally repairable code (LRC) if each of its coordinates can be repaired by accessing at most r$ other coordinates. When some of the r$ coordinates are also erased, the r$ -local LRC cannot accomplish the local repair, which leads to the concept of (r,\delta)$ -locality. A q is said to have (r, \delta)$ -locality ( \delta \ge 2$ ) if for each coordinate i with support containing $i$ , whose length is at most $r + \delta - 1$ , and whose minimum distance is at least $\delta$ . The $(r, \delta)$ -LRC can tolerate $\delta -1$ erasures in every local code (i.e., punctured subcode), which degenerates to an $r$ -local LRC when $\delta =2$ . A $q$ -ary $(r,\delta)$ LRC is called optimal if it meets the singleton-like bound for $(r,\delta)$ -LRCs. A class of optimal $q$ -ary cyclic $r$ -local LRCs with lengths $n\mid q-1$ were constructed by Tamo, Barg, Goparaju, and Calderbank based on the $q$ -ary Reed-Solomon codes. In this paper, we construct a class of optimal $q$ -ary cyclic $(r,\delta)$ -LRCs ( $\delta \ge 2$ ) with length $n\mid q-1$ , which generalizes the results of Tamo et al. Moreover, we construct a new class of optimal $q$ -ary cyclic $r$ -local LRCs with lengths $n\mid q+1$ and a new class of optimal $q$ -ary cyclic $(r,\delta)$ -LRCs ( $\delta \ge 2$ ) with lengths $n\mid q+1$ . The constructed optimal LRCs with length $n=q+1$ have the best-known length for a given finite field with size $q$ when the minimum distance is larger than 4. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
46. Narrow-Sense BCH Codes Over \mathrm GF(q) With Length n=\frac q^m-1q-1.
- Author
-
Li, Shuxing, Ding, Cunsheng, Xiong, Maosheng, and Ge, Gennian
- Subjects
CYCLIC codes ,QUADRATIC forms ,BCH codes ,DECODING algorithms ,TELECOMMUNICATION systems - Abstract
Cyclic codes are widely employed in communication systems, storage devices, and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over \mathrm GF(q) with length n=(q^m-1)/(q-1) . Little is known about this class of BCH codes when $q>2$ . The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of some ternary BCH codes with length n=(3^{m}-1)/2 are determined in this paper. A class of ternary BCH codes meeting the Griesmer bound is identified. An application of some of the BCH codes in secret sharing is also investigated. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
47. The q -Ary Antiprimitive BCH Codes.
- Author
-
Zhu, Hongwei, Shi, Minjia, Wang, Xiaoqiang, and Helleseth, Tor
- Subjects
CYCLIC codes ,LINEAR codes ,DECODING algorithms ,LIQUID crystal displays - Abstract
It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite fields and analyse their parameters. Some lower bounds on the minimum distance of antiprimitive BCH codes are given. The BCH codes presented in this paper have good parameters in general, containing many optimal linear codes. In particular, two open problems about the minimum distance of BCH codes of this type are partially solved in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
48. Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights.
- Author
-
Liu, Hongwei and Pan, Xu
- Subjects
LINEAR codes ,ISOMORPHISM (Mathematics) ,HAMMING distance ,FINITE fields ,HAMMING weight - Abstract
In this paper, we introduce the notion of generalized pair weights of an $[n, k]$ -linear code over the finite field $\mathbb {F}_{q}$ and the notion of pair $r$ -equiweight codes, where $1\le r\le k-1$. Some basic properties of generalized pair weights of linear codes over finite fields are derived. We obtain a necessary and sufficient condition for an $[n,k]$ -linear code to be a pair equiweight code, and we characterize pair $r$ -equiweight codes for any $1\le r\le k-1$. A necessary and sufficient condition for a linear isomorphism to preserve pair weights between two linear codes is obtained. At the end of this paper, an application of generalized pair weights of linear codes to symbol-pair read wire-tap channels of type II is introduced. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
49. Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes.
- Author
-
Pereira, Francisco Revson F., Pellikaan, Ruud, Guardia, Giuliano Gadioli La, and de Assis, Francisco Marcos
- Subjects
ALGEBRAIC geometry ,ERROR-correcting codes ,ALGEBRAIC codes ,DECOHERENCE (Quantum mechanics) ,LINEAR codes ,QUANTUM noise ,LIQUID crystal displays - Abstract
Quantum error-correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error-correcting codes to achieve higher rates than the one obtained by means of the traditional stabilizer formalism. Such codes are called entanglement-assisted quantum error-correcting (EAQEC) codes. In this paper, we utilize algebraic geometry codes to construct several families of EAQEC codes derived from the Euclidean and the Hermitian construction. Three families constructed here consist of codes whose quantum Singleton defect is equal to zero, one, or two. We also construct families of EAQEC codes with an encoding rate exceeding the quantum Gilbert-Varshamov bound. Additionally, asymptotically good towers of linear complementary dual codes are used to obtain asymptotically good families of EAQEC codes consuming maximal entanglement. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that, by utilizing the proposed construction, it is possible to generate an asymptotically family of EAQEC codes that exceeds this bound. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
50. New Results on Self-Dual Generalized Reed-Solomon Codes.
- Author
-
Ning, Yu, Ye, Zuo, Ge, Gennian, Miao, Fuyou, Xiong, Yan, and Zhang, Xiande
- Subjects
RESEARCH & development ,REED-Solomon codes ,LINEAR codes ,TELECOMMUNICATION satellites - Abstract
This paper focuses on constructions of MDS self-dual codes from (extended) generalized Reed-Solomon (GRS) codes. Let $q = r^{2}$ be an odd prime power. We show that, there exists a $q$ -ary self-dual (extended) GRS code for each even length in the range $[{2r,3r-3}]$ , and for each singly even length in the range $[3r-1,4r]$. This extends the only known consecutive range $[2,2r]$ to $[{2,3r-3}]$ for this case. Furthermore, our general constructions provide many MDS self-dual codes with new parameters which, to the best of our knowledge, were not reported before. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.