Fast decoding of quasi-perfect Lee distance codes

A code D over Z ² _n is called a quasi-perfect Lee distance-(2t + 1) code if d _L(V,W) ≥ 2t + 1 for every two code words V,W in D, and every word in Z ² _n is at distance ≤ t + 1 from at least one code word, where D _L(V,W) is the Lee distance of V and W. In this paper we present a fast decoding algorithm for quasi-perfect Lee codes. The basic idea of the algorithm comes from a geometric representation of D in the 2-dimensional plane. It turns out that to decode a word it suffices to calculate its distance to at most four code words.     

Bounds in the Lee metric and optimal codes

In this paper we investigate known Singleton-like bounds in the Lee metric and characterize their extremal codes, which turn out to be very few. We then focus on Plotkin-like bounds in the Lee metric and present a new bound that extends and refines a previously known, and out-performs it in the case of non-free codes. We then compute the density of extremal codes with regard to the new bound. Finally we fill a gap in the characterization of Lee-equidistant codes.     

A generalization of the Lee distance and error correcting codes

In this contribution, we will define an l-dimensional Lee distance which is a generalization of the Lee distance defined only over a prime field, and we will construct 2-error correcting codes for this distance. Our l-dimensional Lee distance can be defined not only over a prime field but also over any finite field. The ordinary Lee distance is just the one-dimensional Lee distance. Also the Mannheim or modular distances introduced by Huber are special cases of our distance.     

On perfect Lee codes

In this paper we survey recent results on the Golomb-Welch conjecture and its generalizations and variations. We also show that there are no perfect 2-error correcting Lee codes of block length 5 and 6 over Z. This provides additional support for the Golomb Welch conjecture as it settles the two smallest cases open so far.     

New upper bounds on Lee codes

The paper considers exact values of and upper bounds on the maximal cardinality of a q-ary Lee code of length n with a minimum distance ?d. Special attention is paid to small parameters. Some new results are presented and tables with the presently known best upper bounds are given for q∈{5,6,7} and n?7.     

Weighted perfect codes in Lee metric

In this talk, we will present results about perfect weighted coverings of radius 1 in the Lee metric. Weighted coverings are a very natural generalization of many classes of codes. Perfect weighted coverings are well studied in the Hamming metric, but also in other contexts with different names, such as regular-sets, multiple coverings or [a, b]-dominating sets. In this talk, we present results of existence as well as of non-existence for perfect weighted coverings of radius one on the multidimensional grid graphs.     

Enumerating and decoding perfect linear Lee codes

Using group theory approach, we determine all numbers q for which there exists a linear 1-error correcting perfect Lee code of block length n over Z _q , and then we enumerate those codes. At the same time this approach allows us to design a linear time decoding algorithm.      

Finite metrics in switching classes

Let g:D×D→R be a symmetric function on a finite set D satisfying g(x,x)=0 for all x∈D. A switch g^σ of g w.r.t. a local valuation σ:D→R is defined by g^σ(x,y)=σ(x)+g(x,y)+σ(y) for x≠y and g^σ(x,x)=0 for all x. We show that every symmetric function g has a unique minimal semimetric switch, and, moreover, there is a switch of g that is isometric to a finite Manhattan metric. Also, for each metric on D, we associate an extension metric on the set of all nonempty subsets of D, and we show that this extended metric inherits the switching classes on D.     

Cardinal rank metric codes over Galois rings

In 1985, Gabidulin introduced the rank metric in coding theory over finite fields, and used this kind of codes in a McEliece cryptosystem, six years later. In this paper, we consider rank metric codes over Galois rings. We propose a suitable metric for codes over such rings, and show its main properties. With this metric, we define Gabidulin codes over Galois rings, propose an efficient decoding algorithm for them, and hint their cryptographic application.     

The structure of linear codes of constant weight

In this paper we determine completely the structure of linear codes over of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, two forms of Euclidean weight, and pre-homogeneous weights. We prove a general uniqueness theorem for virtual linear codes of constant weight. Existence is settled on a case by case basis.

     

Variation of cone metrics on Riemann surfaces

We discuss the variational properties of the unique conical metric of constant curvature −1 associated to a compact Riemann surface together with a weighted divisor.     

Correction of CT burst array errors in the generalized-lee-RT spaces

In [Jain, S.： Array codes in the generalized-Lee-RT-pseudo-metric （the GLRTP-metric）, to appear in Algebra Colloq.], Jain introduced a new pseudo-metric on the space Matm×s（Zq）, the module space of all m × s matrices with entries from the finite ring Zq, generalized the classical Lee metric [Lee, C. Y.： Some properties of non-binary error correcting codes. IEEE Trans. Inform. Theory, IT-4, 77- 82 （1958）] and array RT-metric [Rosenbloom, M. Y., Tsfasman, M. A.： Codes for m-metric. Prob. Inf. Transm., 33, 45-52 （1997）] and named this pseudo-metric as the Generalized-Lee-RT-Pseudo-Metric （or the GLRTP-Metric）. In this paper, we obtain some lower bounds for two-dimensional array codes correcting CT burst array errors [Jain, S.： CT bursts from classical to array coding. Discrete Math., 308-309, 1489-1499 （2008）] with weight constraints under the GLRTP-metric.     

Doubly and triply extended MSRD codes

In this work, doubly extended linearized Reed–Solomon codes and triply extended Reed–Solomon codes are generalized. We obtain a general result in which we characterize when a multiply extended code for a general metric attains the Singleton bound. We then use this result to obtain several families of doubly extended and triply extended maximum sum-rank distance (MSRD) codes that include doubly extended linearized Reed–Solomon codes and triply extended Reed–Solomon codes as particular cases. To conclude, we discuss when these codes are one-weight codes.     

超球Bloch空间上的有界加权复合算子

本文证明了高维超球Bloch空间上的加权复合算子成为有界算子的一个充分且必要的条件.     

Labelings of Lee and Hamming spaces

The labeling of the Hamming Space by the rotation group and its coordinate-wise extension to give rise to the concept of -linearity. Attempts to extend this concept have been done in different ways. We deal with a natural extension question: Is there any pattern of a cyclic group G labeling of with the Hamming or Lee metric? The answer is no. Actually, we show here that Lee spaces do not allow even labelings by abelian groups, what lead us to construct labelings by semi-direct products of abelian groups. Labelings of general Hamming spaces and of Reed–Muller codes RM(1,m) are characterized here in the context of isometry groups.     

Some new non-additive maximum rank distance codes

In this paper, a construction of maximum rank distance (MRD) codes as a generalization of generalized Gabidulin codes is given. The family of the resulting codes is not covered properly by additive generalized twisted Gabidulin codes, and does not cover all twisted Gabidulin codes. When the basis field has more than two elements, this family includes also non-affine MRD codes, and such codes exist for all parameters. Therefore, these codes are the first non-additive MRD codes for most of the parameters.     

Weighted external difference families and R-optimal AMD codes

In this paper, we provide a mathematical framework for characterizing AMD codes that are R-optimal. We introduce a new combinatorial object, the reciprocally-weighted external difference family (RWEDF), which corresponds precisely to an R-optimal weak AMD code. This definition subsumes known examples of existing optimal codes, and also encompasses combinatorial objects not covered by previous definitions in the literature. By developing structural group-theoretic characterizations, we exhibit infinite families of new RWEDFs, and new construction methods for known objects such as near-complete EDFs. Examples of RWEDFs in non-abelian groups are also discussed.