Algebraic-geometry codes, one-point codes, and evaluation codes

One-point codes are those algebraic-geometry codes for which the associated divisor is a non-negative multiple of a single point. Evaluation codes were defined in order to give an algebraic generalization of both one-point algebraic-geometry codes and Reed–Muller codes. Given an -algebra A, an order function on A and given a surjective -morphism of algebras , the ith evaluation code with respect to is defined as the code . In this work it is shown that under a certain hypothesis on the -algebra A, not only any evaluation code is a one-point code, but any sequence of evaluation codes is a sequence of one-point codes. This hypothesis on A is that its field of fractions is a function field over and that A is integrally closed. Moreover, we see that a sequence of algebraic-geometry codes G _i with associated divisors is the sequence of evaluation codes associated to some -algebra A, some order function and some surjective morphism with if and only if it is a sequence of one-point codes.      

Construction of long MDS self-dual codes from short codes

In this paper, we propose a mechanism on how to construct long MDS self-dual codes from short ones. These codes are special types of generalized Reed-Solomon (GRS) codes or extended generalized Reed-Solomon codes. The main tool is utilizing additive structure or multiplicative structure on finite fields. By applying this method, more MDS self-dual codes can be constructed.     

A new concatenated type construction for LCD codes and isometry codes

We give a new concatenated type construction for linear codes with complementary dual (LCD) over small finite fields. In this construction,we need a special class of inner codes that we call isometry codes. Our construction generalizes a recent construction of Carlet et al. (2014–2016) and of Güneri et al. (2016). In particular, it allows us to construct LCD codes with improved parameters directly.     

Linear error-block codes

A linear error-block code is a natural generalization of the classical error-correcting code and has applications in experimental design, high-dimensional numerical integration and cryptography. This article formulates the concept of a linear error-block code and derives basic results for this kind of code by direct analogy to the classical case. Some problems for further research are raised.     

Traceability codes

Traceability codes are combinatorial objects introduced by Chor, Fiat and Naor in 1994 to be used in traitor tracing schemes to protect digital content. A k-traceability code is used in a scheme to trace the origin of digital content under the assumption that no more than k users collude. It is well known that an error correcting code of high minimum distance is a traceability code. When does this ‘error correcting construction’ produce good traceability codes? The paper explores this question.Let ? be a fixed positive integer. When q is a sufficiently large prime power, a suitable Reed-Solomon code may be used to construct a 2-traceability code containing q⌈?/4⌉ codewords. The paper shows that this construction is close to best possible: there exists a constant c, depending only on ?, such that a q-ary 2-traceability code of length ? contains at most cq⌈?/4⌉ codewords. This answers a question of Kabatiansky from 2005.Barg and Kabatiansky (2004) asked whether there exist families of k-traceability codes of rate bounded away from zero when q and k are constants such that q?k². These parameters are of interest since the error correcting construction cannot be used to construct k-traceability codes of constant rate for these parameters: suitable error correcting codes do not exist when q?k² because of the Plotkin bound. Kabatiansky (2004) answered Barg and Kabatiansky's question (positively) in the case when k=2. This result is generalised to the following: whenever k and q are fixed integers such that k?2 and q?k²−⌈k/2⌉+1, or such that k=2 and q=3, there exist infinite families of q-ary k-traceability codes of constant rate.     

New optimal subsystem codes

Subsystem codes (also known as operator quantum error-correcting codes) are a generalization of noiseless subsystems, decoherence-free subspaces, and quantum error-correcting codes. In this note, we present a construction for new subsystem codes with parameters _{[[q2+1,(q−1)2,4,q−1]]q}${\left[[q^2+1,{(q-1)}^2,4,q-1]\right]}_q$, where q=2^m$q=2^m$, and m≥1$m\ge 1$ is a positive integer, whose parameters are not covered by the codes available in the literature. Moreover, the constructed subsystem codes are optimal.     

测试模糊码的一种算法

Abstract. How to verify that a given fuzzy set A∈F(X ) is a fuzzy code? In this paper, an al-gorithm of test has been introduced and studied with the example of test. The measure notionfor a fuzzy code and a precise formulation of fuzzy codes and words have been discussed.     

On the uniform hyperbolicity of some nonuniformly hyperbolic systems

We give sufficient conditions for the uniform hyperbolicity of certain nonuniformly hyperbolic dynamical systems. In particular, we show that local diffeomorphisms that are nonuniformly expanding on sets of total probability (probability one with respect to every invariant probability measure) are necessarily uniformly expanding. We also present a version of this result for diffeomorphisms with nonuniformly hyperbolic sets.

     

A class of almost MDS codes

MDS codes and almost MDS (AMDS) codes are special classes of linear codes, and have important applications in communications, data storage, combinatorial theory, and secrete sharing. The objective of this paper is to present a class of AMDS codes from some BCH codes and determine their parameters. It turns out the proposed AMDS codes are distance-optimal and dimension-optimal locally repairable codes. The parameters of the duals of this class of AMDS codes are also discussed.     

On the additive cyclic structure of quasi-cyclic codes

An index $?$, length $m?$ quasi-cyclic code can be viewed as a cyclic code of length $m$ over the field ${\mathbb{F}}_{q^{?}}$ via a basis of the extension ${\mathbb{F}}_{q^{?}}∕{\mathbb{F}}_q$. However, this cyclic code is only linear over ${\mathbb{F}}_q$, making it an additive cyclic code, or an ${\mathbb{F}}_q$-linear cyclic code, over the alphabet ${\mathbb{F}}_{q^{?}}$. This approach was recently used in Shi et al. (2017) [16] to study a class of quasi-cyclic codes, and more importantly in Shi et al. (2017) [17] to settle a long-standing question on the asymptotic performance of cyclic codes. Here, we answer one of the problems posed in these two articles, and characterize those quasi-cyclic codes which have ${\mathbb{F}}_{q^{?}}$-linear cyclic images under a basis of the extension ${\mathbb{F}}_{q^{?}}∕{\mathbb{F}}_q$. Our characterizations are based on the module structure of quasi-cyclic codes, as well as on their CRT decompositions into constituents. In the case of a polynomial basis, we characterize the constituents by using the theory of invariant subspaces of operators. We also observe that analogous results extend to the case of quasi-twisted codes.     

On constant composition codes

A constant composition code over a k-ary alphabet has the property that the numbers of occurrences of the k symbols within a codeword is the same for each codeword. These specialize to constant weight codes in the binary case, and permutation codes in the case that each symbol occurs exactly once. Constant composition codes arise in powerline communication and balanced scheduling, and are used in the construction of permutation codes. In this paper, direct and recursive methods are developed for the construction of constant composition codes.