The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes

One of the most important problems of coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes have been proven to contain many such codes. In this paper, we consider quasi-twisted (QT) codes, which are generalizations of QC codes, and their structural properties and obtain new codes which improve minimum distances of best known linear codes over the finite fields GF(3) and GF(5). Moreover, we give a BCH-type bound on minimum distance for QT codes and give a sufficient condition for a QT code to be equivalent to a QC code.     

A new approach to the covering radius of codes

We introduce a new approach which facilitates the calculation of the covering radius of a binary linear code. It is based on determining the normalized covering radius ϱ. For codes of fixed dimension we give upper and lower bounds on ϱ that are reasonably close. As an application, an explicit formula is given for the covering radius of an arbitrary code of dimension ⩽4. This approach also sheds light on whether or not a code is normal. All codes of dimension ⩽4 are shown to be normal, and an upper bound is given for the norm of an arbitrary code. This approach also leads to an amusing generalization of the Berlekamp-Gale switching game.     

Decomposition of Modular Codes for Computing Test Sets and Graver Basis

In order to obtain the set of codewords of minimal support for codes defined over ${\mathbb{Z}_q}$ , one can compute a Graver basis of the ideal associated to such codes. The main aim of this article is to reduce the complexity of the algorithm obtained by the authors in a previous work taking advantage of the powerful decomposition theory for linear codes provided by the decomposition theory of representable matroids over finite fields. In this way we identify the codes that can be written as ??gluing?? of codes of shorter length. If this decomposition verifies certain properties then computing the set of codewords of minimal support in each code appearing in the decomposition is equivalent to computing the set of codewords of minimal support for the original code. Moreover, these computations are independent of each other, thus they can be carried out in parallel for each component, thereby not only obtaining a reduction of the complexity of the algorithm but also decreasing the time needed to process it.     

On generator and parity-check polynomial matrices of generalized quasi-cyclic codes

Generalized quasi-cyclic (GQC) codes have been investigated as well as quasi-cyclic (QC) codes, e.g., on the construction of efficient low-density parity-check codes. While QC codes have the same length of cyclic intervals, GQC codes have different lengths of cyclic intervals. Similarly to QC codes, each GQC code can be described by an upper triangular generator polynomial matrix, from which the systematic encoder is constructed. In this paper, a complete theory of generator polynomial matrices of GQC codes, including a relation formula between generator polynomial matrices and parity-check polynomial matrices through their equations, is provided. This relation generalizes those of cyclic codes and QC codes. While the previous researches on GQC codes are mainly concerned with 1-generator case or linear algebraic approach, our argument covers the general case and shows the complete analogy of QC case. We do not use Gröbner basis theory explicitly in order that all arguments of this paper are self-contained. Numerical examples are attached to the dual procedure that extracts one from each other. Finally, we provide an efficient algorithm which calculates all generator polynomial matrices with given cyclic intervals.     

Codes of Small Defect

The parameters of a linear code C over GF(q) are given by [n,k,d], where n denotes the length, k the dimension and d the minimum distance of C. The code C is called MDS, or maximum distance separable, if the minimum distance d meets the Singleton bound, i.e. d = n-k+1 Unfortunately, the parameters of an MDS code are severely limited by the size of the field. Thus we look for codes which have minimum distance close to the Singleton bound. Of particular interest is the class of almost MDS codes, i.e. codes for which d=n-k. We will present a condition on the minimum distance of a code to guarantee that the orthogonal code is an almost MDS code. This extends a result of Dodunekov and Landgev Dodunekov. Evaluation of the MacWilliams identities leads to a closed formula for the weight distribution which turns out to be completely determined for almost MDS codes up to one parameter. As a consequence we obtain surprising combinatorial relations in such codes. This leads, among other things, to an answer to a question of Assmus and Mattson 5 on the existence of self-dual [2d,d,d]-codes which have no code words of weight d+1. Actually there are more codes than Assmus and Mattson expected, but the examples which we know are related to the expected ones.     

Improved decoding of affine-variety codes

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding techniques for affine-variety codes using some multidimensional extensions of general error locator polynomials. We prove the existence of such polynomials for any correctable affine-variety code and hence for any linear code. We propose two main different approaches, that depend on the underlying geometry. We compute some interesting cases, including Hermitian codes. To prove our coding theory results, we develop a theory for special classes of zero-dimensional ideals, that can be considered generalizations of stratified ideals. Our improvement with respect to stratified ideals is twofold: we generalize from one variable to many variables and we introduce points with multiplicities.     

Robust locally testable codes and products of codes

We continue the investigation of locally testable codes, i.e., error‐correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of robust probabilistically checkable proofs, we introduce the notion of robust local testability of codes. We relate this notion to a product of codes introduced by Tanner and show a very simple composition lemma for this notion. Next, we show that codes built by tensor products can be tested robustly and somewhat locally by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low‐degree multivariate polynomials (which are a special case of tensor codes). Combining these two results gives us a generic construction of codes of inverse polynomial rate that are testable with poly‐logarithmically many queries. We note that these locally testable tensor codes can be obtained from any linear error correcting code with good distance. Previous results on local testability, albeit much stronger quantitatively, rely heavily on algebraic properties of the underlying codes. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension

We derive the maximum decoding radius for interleaved Hermitian (IH) codes if a collaborative decoding scheme is used. A decoding algorithm that achieves this bound, which is based on a division decoding algorithm, is given. Based on the decoding radius for the interleaved codes, we derive a bound on the code rate below which virtual extension of non-interleaved Hermitian codes can improve the decoding capabilities.     

On the construction of prefix-free and fix-free codes with specified codeword compositions

We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimize the average codeword cost for general letter costs with uniform distribution of the codewords and present an approximation algorithm to find a near optimal fix-free code with a given constant cost.     

On complementary dual quasi-twisted codes

A linear complementary-dual (LCD) code C is a linear code whose dual code \(C^{\perp }\) satisfies \(C \cap C^{\perp }=\{0\}\). In this work we characterize some classes of LCD q-ary \((\lambda , l)\)-quasi-twisted (QT) codes of length \(n=ml\) with \((m,q)=1\), \(\lambda \in F_{q} \setminus \{0\}\) and \(\lambda \ne \lambda ^{-1}\). We show that every \((\lambda ,l)\)-QT code C of length \(n=ml\) with \(dim(C)<m\) or \(dim(C^{\perp })<m\) is an LCD code. A sufficient condition for r-generator QT codes is provided under which they are LCD. We show that every maximal 1-generator \((\lambda ,l)\)-QT code of length \(n=ml\) with \(l>2\) is either an LCD code or a self-orthogonal code and a sufficient condition for this family of codes is given under which such a code C is LCD. Also it is shown that every maximal 1-generator \((\lambda ,2)\)-QT code is LCD. Several good and optimal LCD QT codes are presented.     

Independence of vectors in codes over rings

We study codes over Frobenius rings. We describe Frobenius rings via an isomorphism to the product of local Frobenius rings and use this decomposition to describe an analog of linear independence. Special attention is given to codes over principal ideal rings and a basis for codes over principal ideal rings is defined. We prove that a basis exists for any code over a principal ideal ring and that any two basis have the same number of vectors. Hongwei Liu is supported by the National Natural Science Foundation of China (10571067).     

Generalized Gabidulin codes over fields of any characteristic

We generalize Gabidulin codes to a large family of fields, non necessarily finite, possibly with characteristic zero. We consider a general field extension and any automorphism in the Galois group of the extension. This setting enables one to give several definitions of metrics related to the rank-metric, yet potentially different. We provide sufficient conditions on the given automorphism to ensure that the associated rank metrics are indeed all equal and proper, in coherence with the usual definition from linearized polynomials over finite fields. Under these conditions, we generalize the notion of Gabidulin codes. We also present an algorithm for decoding errors and erasures, whose complexity is given in terms of arithmetic operations. Over infinite fields the notion of code alphabet is essential, and more issues appear that in the finite field case. We first focus on codes over integer rings and study their associated decoding problem. But even if the code alphabet is small, we have to deal with the growth of intermediate values. A classical solution to this problem is to perform the computations modulo a prime ideal. For this, we need study the reduction of generalized Gabidulin codes modulo an ideal. We show that the codes obtained by reduction are the classical Gabidulin codes over finite fields. As a consequence, under some conditions, decoding generalized Gabidulin codes over integer rings can be reduced to decoding Gabidulin codes over a finite field.     

正则强码的分解与伯努利分布

本文得到正则强码的伯努利分布定理。还研究强码的分解,给出正则强码可分解为两个正则强码复合的充要条件。     

Construction of binary LCD codes,ternary LCD codes and quaternary Hermitian LCD codes

We give two methods for constructing many linear complementary dual (LCD for short) codes from a given LCD code, by modifying some known methods for constructing self-dual codes. Using the methods, we construct binary LCD codes and quaternary Hermitian LCD codes, which improve the previously known lower bounds on the largest minimum weights.

     

Bounds on Spectra of Codes with Known Dual Distance

We estimate the interval where the distance distribution of a code of length n and of given dual distance is upperbounded by the binomial distribution. The binomial upper bound is shown to be sharp in this range in the sense that for every subinterval of size about √n ln n there exists a spectrum component asymptotically achieving the binomial bound. For self-dual codes we give a better estimate for the interval of binomiality.     

张量积码的多重覆盖半径

码的多重覆盖半径是最近对码的通常覆盖半径的一个推广．本文研究了由两个二元线性码构成的张量积码的多重覆盖半径．并得到了该张量积码的多重覆盖半径的界．     

Weight distributions and weight hierarchies of two classes of binary linear codes

Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of a linear code has many applications such as on the type II wire-tap channel, dealing with t-resilient functions and trellis or branch complexity of linear codes and so on. In this paper, we present a formula for computing the weight hierarchies of linear codes constructed by the generalized method of defining sets. Then, we construct two classes of binary linear codes with a few weights and determine their weight distributions and weight hierarchies completely. Some codes of them can be used in secret sharing schemes.     

On maximal Spherical codes II

We consider spherical codes attaining the Levenshtein upper bounds on the cardinality of codes with prescribed maximal inner product. We prove that the even Levenshtein bounds can be attained only by codes which are tight spherical designs. For every fixed n ≥ 5, there exist only a finite number of codes attaining the odd bounds. We derive different expressions for the distance distribution of a maximal code. As a by-product, we obtain a result about its inner products. We describe the parameters of those codes meeting the third Levenshtein bound, which have a regular simplex as a derived code. Finally, we discuss a connection between the maximal codes attaining the third bound and strongly regular graphs. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 316–326, 1999     

卡氏积码的r-MDR码与P_r-MDS码

本文研究了卡氏积码的r-广义Hamming重量计算公式和广义Singleton界,利用r-卡氏积码的子码仍为卡氏积码,证明了r-MDR码或Pr-MDR码的卡氏积码仍为r-MDR码或Pr-MDR码.同时也给出了这一个结果的部分逆命题.