On the automorphisms of generalized algebraic geometry codes

Designs, Codes and Cryptography - We consider the class of generalized algebraic geometry codes (GAG codes) formed by two collections of places, with places of the same degree in each collection....     

Testing algebraic geometric codes

Property testing was initially studied from various motivations in 1990’s. A code C  GF (r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector’s coordinates. The problem of testing codes was firstly studied by Blum, Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs). How to characterize locally te...     

On the order bound of one-point algebraic geometry codes

Let S={s_i}_i∈N⊆N be a numerical semigroup. For each i∈N, let ν(s_i) denote the number of pairs (s_i−s_j,s_j)∈S²: it is well-known that there exists an integer m such that the sequence {ν(s_i)}_i∈N is non-decreasing for i>m. The problem of finding m is solved only in special cases. By way of a suitable parameter t, we improve the known bounds for m and in several cases we determine m explicitly. In particular we give the value of m when the Cohen-Macaulay type of the semigroup is three or when the multiplicity is less than or equal to six. When S is the Weierstrass semigroup of a family {C_i}_i∈N of one-point algebraic geometry codes, these results give better estimates for the order bound on the minimum distance of the codes {C_i}.     

On the unique representation of very strong algebraic geometry codes

This paper addresses the question of retrieving the triple ${(\mathcal X,\mathcal P, E)}$ from the algebraic geometry code ${\mathcal C = \mathcal C_L(\mathcal X, \mathcal P, E)}$ , where ${\mathcal X}$ is an algebraic curve over the finite field ${\mathbb F_q, \,\mathcal P}$ is an n-tuple of ${\mathbb F_q}$ -rational points on ${\mathcal X}$ and E is a divisor on ${\mathcal X}$ . If ${\deg(E)\geq 2g+1}$ where g is the genus of ${\mathcal X}$ , then there is an embedding of ${\mathcal X}$ onto ${\mathcal Y}$ in the projective space of the linear series of the divisor E. Moreover, if ${\deg(E)\geq 2g+2}$ , then ${I(\mathcal Y)}$ , the vanishing ideal of ${\mathcal Y}$ , is generated by ${I_2(\mathcal Y)}$ , the homogeneous elements of degree two in ${I(\mathcal Y)}$ . If ${n >2 \deg(E)}$ , then ${I_2(\mathcal Y)=I_2(\mathcal Q)}$ , where ${\mathcal Q}$ is the image of ${\mathcal P}$ under the map from ${\mathcal X}$ to ${\mathcal Y}$ . These three results imply that, if ${2g+2\leq m < \frac{1}{2}n}$ , an AG representation ${(\mathcal Y, \mathcal Q, F)}$ of the code ${\mathcal C}$ can be obtained just using a generator matrix of ${\mathcal C}$ where ${\mathcal Y}$ is a normal curve in ${\mathbb{P}^{m-g}}$ which is the intersection of quadrics. This fact gives us some clues for breaking McEliece cryptosystem based on AG codes provided that we have an efficient procedure for computing and decoding the representation obtained.     

Distance bounds for algebraic geometric codes

Various methods have been used to obtain improvements of the Goppa lower bound for the minimum distance of an algebraic geometric code. The main methods divide into two categories, and all but a few of the known bounds are special cases of either the Lundell-McCullough floor bound or the Beelen order bound. The exceptions are recent improvements of the floor bound by Güneri, Stichtenoth, and Taskin, and by Duursma and Park, and of the order bound by Duursma and Park, and by Duursma and Kirov. In this paper, we provide short proofs for all floor bounds and most order bounds in the setting of the van Lint and Wilson AB method. Moreover, we formulate unifying theorems for order bounds and formulate the DP and DK order bounds as natural but different generalizations of the Feng-Rao bound for one-point codes.     

Coset bounds for algebraic geometric codes

We develop new coset bounds for algebraic geometric codes. The bounds have a natural interpretation as an adversary threshold for algebraic geometric secret sharing schemes and lead to improved bounds for the minimum distance of an AG code. Our bounds improve both floor bounds and order bounds and provide for the first time a connection between the two types of bounds.     

Near-MDS codes arising from algebraic curves

Every elliptic quartic Γ₄ of PG(3,q) with nGF(q)-rational points provides a near-MDS code C of length n and dimension 4 such that the collineation group of Γ₄ is isomorphic to the automorphism group of C. In this paper we assume that GF(q) has characteristic p>3. We classify the linear collineation groups of PG(3,q) which can preserve an elliptic quartic of PG(3,q). Also, we prove for q?113 that if the j-invariant of Γ₄ does not disappear, then C cannot be extended in a natural way by adding a point of PG(3,q) to Γ₄.     

Packing superballs from codes and algebraic curves

In the present paper, we make use of codes with good parameters and algebraic curves over finite fields with many rational points to construct dense packings of superballs. It turns out that our packing density is quite reasonable. In particular, we improve some values for the best-known lower bounds on packing density.     

Nonbinary quantum error-correcting codes from algebraic curves

We give a new exposition and proof of a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes with various lengths, dimensions, and minimum distances from algebraic curves. We also give asymptotically good nonbinary quantum codes from a Garcia–Stichtenoth tower of function fields which are constructible in polynomial time.     

On the structure of some group codes

In this paper, we study the following problem: Which characteristics does a codeC possess when the syntactic monoidsyn(C ^*) of the star closureC ^* ofC is a group? For a codeC, if the syntactic monoidsyn(C ^*) is a group, then we callC a group code. This definition of a group code is different from the one in [1] (see [1], 46–47). Schützenberger had characterized the structure of finite group codes and had proved thatC is a finite group code if and only ifC is a full uniform code (see [5], [8]). Fork-prefix andk-suffix codes withk≥2,k-infix,k-outfix,p-infix,s-infix, right semaphore codes and left semaphore codes, etc., we obtain similar results. It is proved that the above mentioned codes are group codes if and only if they are uniform codes.     

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.     

The order bound for general algebraic geometric codes

The order bound gives an in general very good lower bound for the minimum distance of one-point algebraic geometric codes coming from curves. This paper is about a generalization of the order bound to several-point algebraic geometric codes coming from curves.     

代数函数域上的局部恢复码

假设C是有限域Fq上的[n,k]线性码,如果码字的每个坐标是其它至多r个坐标的函数,称C是(n,k,r)线性码,这里r是较小的数.本文在代数函数域上构造出了局部恢复码,它的码长不受字符集大小的限制,实际上,它的码长可以远远大于字符集的大小;并将此方法应用于广义Hermite函数域,得到了一类广义Hermite函数域上的...     

On algebraic K-theory of real algebraic varieties with circle action

Assume that X is a compact connected orientable nonsingular real algebraic variety with an algebraic free S¹-action so that the quotient Y=X/S¹ is also a real algebraic variety. If π : X→Y is the quotient map then the induced map between reduced algebraic K-groups, tensored with ,

Full-size image

is onto, where , denoting the ring of entire rational (regular) functions on the real algebraic variety X, extending partially the Bochnak–Kucharz result that

Full-size image

for any real algebraic variety X. As an application we will show that for a compact connected Lie group G .     

Exponents of polar codes using algebraic geometric code kernels

Reed–Solomon and BCH codes were considered as kernels of polar codes by Mori and Tanaka (IEEE Information Theory Workshop, 2010, pp 1–5) and Korada et al. (IEEE Trans Inform Theory 56(12):6253–6264, 2010) to create polar codes with large exponents. Mori and Tanaka showed that Reed–Solomon codes over the finite field \(\mathbb {F}_q\) with \(q\) elements give the best possible exponent among all codes of length \(l \le q\) . They also stated that a Hermitian code over \(\mathbb {F}_{2^r}\) with \(r \ge 4\) , a simple algebraic geometric code, gives a larger exponent than the Reed–Solomon matrix over the same field. In this paper, we expand on these ideas by employing more general algebraic geometric (AG) codes to produce kernels of polar codes. Lower bounds on the exponents are given for kernels from general AG codes, Hermitian codes, and Suzuki codes. We demonstrate that both Hermitian and Suzuki kernels have larger exponents than Reed–Solomon codes over the same field, for \(q \ge 3\) ; however, the larger exponents are at the expense of larger kernel matrices. Comparing kernels of the same size, though over different fields, we see that Reed–Solomon kernels have larger exponents than both Hermitian and Suzuki kernels. These results indicate a tradeoff between the exponent, kernel matrix size, and field size.     

On the structure of rigid semistable sheaves on algebraic surfaces

LetS be a smooth projective surface, letK be the canonical class ofS and letH be an ample divisor such thatH • K < 0. We prove that for any rigid sheafF (Ext¹ (F, F) = 0) that is Mumford-Takemoto semistable with respect toH there exists an exceptional set (E ₁ ,..., E _n ) of sheaves onS such thatF can be constructed from {E _i } by means of a finite sequence of extensions. Translated fromMatematicheskie Zametki, Vol. 64, No. 5, pp. 692–700, November, 1998. The author wishes to express his gratitude to S. A. Kuleshov for useful discussions and to A. N. Rudakov and A. L. Gorodentsev for their attention to the present work. This research was partially supported by the Russian Foundation for Basic Research under grant No. 96-01-01323 and by the INTAS Foundation.