Higher Weights for Ternary and Quaternary Self-Dual Codes*

We study higher weights applied to ternary and quaternary self-dual codes. We give lower bounds on the second higher weight and compute the second higher weights for optimal codes of length less than 24. We relate the joint weight enumerator with the higher weight enumerator and use this relationship to produce Gleason theorems. Graded rings of the higher weight enumerators are also determined. This work was supported in part by Northern Advancement Center for Science & Technology and the Natural Sciences and Engineering Research Council of Canada.     

基于有限集[N]上相交关系构作的二元等重码

对于自然数s,r,k,N,0相似文献   

二元等重码的一个简单构作及其检错性

对于自然数s,k,t,0相似文献   

A Class of Perfect Ternary Constant-Weight Codes

We construct a class of perfect ternary constant-weight codes of length 2 ^r , weight 2 ^r -1 and minimum distance 3. The codes have codewords. The construction is based on combining cosets of binary Hamming codes. As a special case, for r=2 the construction gives the subcode of the tetracode consisting of its nonzero codewords. By shortening the perfect codes, we get further optimal codes.     

一个二元叠加码M_q(t,k,d)生成的二元等重码

研究了二元叠加码Mq(t,k,d)也是一个二元等重码,给出了它成为最佳等重码的条件,研究了它的检错性.     

4‐*GDD(6n)s and Related Optimal Quaternary Constant‐Weight Codes

Constant‐weight codes (CWCs) have played an important role in coding theory. To construct CWCs, a K‐GDD (where GDD is group divisible design) with the “star” property, denoted by K‐*GDD, was introduced, in which any two intersecting blocks intersect in at most two common groups. In this paper, we consider the existence of 4‐*GDDs. Previously, the necessary conditions for existence were shown to be sufficient for , and also sufficient for with prime powers and . We continue to investigate the existence of 4‐*GDD(6ⁿ)s and show that the necessary condition for the existence of a 4‐*GDD(6ⁿ), namely, , is also sufficient. The known results on the existence of optimal quaternary (n, 5, 4) CWCs are also extended.     

Classification of Some Optimal Ternary Linear Codes of Small Length

A classification is given of some optimal ternary linear codes of small length. Dimension 2 is classified for every minimum distance. Dimension 3, 4 and 5 is classified up to minimum distance 12. For higher dimension a classification is given where possible.     

Maximum distance holey packings and related codes

The notion of a maximum distance holey packing is introduced and used to construct optimal ternary (n, 3, 3) codes for all lengthsn=2 (mod 3) andn≥8. Combining this with Etzion’s result, the existence problem for an optimal ternary (n,3,3) code is solved completely. Project supported by the National Natural Science Foundation of China (Grant No. 19671064).     

On Hermitian LCD codes and their Gray image

We provide methods and algorithms to construct Hermitian linear complementary dual (LCD) codes over finite fields. We study existence of self-dual basis with respect to Hermitian inner product, and as an application, we construct Euclidean LCD codes by projecting the Hermitian codes over such a basis. Many optimal quaternary Hermitian and ternary Euclidean LCD codes are obtained. Comparisons with classical constructions are made.     

A class of optimal constant composition codes from GDRPs

As a common generalization of constant weight binary codes and permutation codes, constant composition codes (CCCs) have attracted recent interest due to their numerous applications. In this paper, a class of new CCCs are constructed using design-theoretic techniques. The obtained codes are optimal in the sense of their sizes. This result is established, for the most part, by means of a result on generalized doubly resolvable packings which is of combinatorial interest in its own right.      

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

一类4维3元线性码的重量谱

GF(q)上[n,k;q]线性码C的重量谱为序列(d1,d2,…dk),其中dr是C的r维子码的最小支持重量.文章利用有限射影几何方法确定了一类4维3元线性码的重量谱,并对其进行了验证.     

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.

     

On diameter perfect constant-weight ternary codes

From cosets of binary Hamming codes we construct diameter perfect constant-weight ternary codes with weight n-1 (where n is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before.     

Cyclically permutable representations of cyclic codes

Cyclically permutable codes have been studied for several applications involving synchronization, code-division multiple-access (CDMA) radio systems and optical CDMA. The usual emphasis is on finding constant weight cyclically permutable codes with the maximum number of codewords. In this paper the question of when a particular error-correcting code is equivalent (by permutation of the symbols) to a cyclically permutable code is addressed. The problem is introduced for simplex codes and a motivating example is given. In the final section it is shown that the construction technique may be applied in general to cyclic codes.     

The characterization of binary constant weight codes meeting the bound of Fu and Shen

Fu and Shen gave an upper bound on binary constant weight codes. In this paper, we present a new proof for the bound of Fu and Shen and characterize binary constant weight codes meeting this bound. It is shown that binary constant weight codes meet the bound of Fu and Shen if and only if they are generated from certain symmetric designs and quasi-symmetric designs in combinatorial design theory. In particular, it turns out that the existence of binary codes with even length meeting the Grey–Rankin bound is equivalent to the existence of certain binary constant weight codes meeting the bound of Fu and Shen. Furthermore, some examples are listed to illustrate these results. Finally, we obtain a new upper bound on binary constant weight codes which improves on the bound of Fu and Shen in certain case. This research is supported in part by the DSTA research grant R-394-000-025-422 and the National Natural Science Foundation of China under the Grant 60402031, and the NSFC-GDSF joint fund under the Grant U0675001     

Johnson type bounds on constant dimension codes

Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Naini when constructing distributed authentication systems in 2003. In this paper, we study constant dimension codes. It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini bound. Furthermore, we show that constant dimension codes achieve the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures. Then, we derive two Johnson type upper bounds, say I and II, on constant dimension codes. The Johnson type bound II slightly improves on the Wang-Xing-Safavi-Naini bound. Finally, we point out that a family of known Steiner structures is actually a family of optimal constant dimension codes achieving both the Johnson type bounds I and II.      

Binary permutation sequences as subsets of Levenshtein codes,spectral null codes,run-length limited codes and constant weight codes

We investigate binary sequences which can be obtained by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of a surprisingly diverse ensemble of codes, namely the Levenshtein codes, capable of correcting insertion/deletion errors; spectral null codes, with spectral nulls at certain frequencies; as well as being subsets of run-length limited codes, Nyquist null codes and constant weight codes. This paper was presented in part at the IEEE Information Theory Workshop, Chengdu, China, October, 2006.     

有限域上一类等维码的下界

等维码凭借其在随机线性网络编码中的良好的差错控制得到广泛研究,对于给定维数和最小距离的等维码所含码字的最大个数目前还没有一般性结果.Tuvi Etzion和Alexander Vardy给出了一定等维码所含码字最大个数的上界和下界,首先利用对偶空间构造等维码C(n,M,2k,k),达到了此类码所含码字的下界,然后具体构造了最优等维码C(7,41,4,2).     

Several classes of optimal ternary cyclic codes with minimal distance four

In this paper, by analyzing the solutions of certain equations over ${\mathbb{F}}_{3^m}$, we present four classes of optimal ternary cyclic codes with parameters $[3^m-1,3^m-1-2m,4]$. It is shown that some recent work on this class of optimal ternary cyclic codes are special cases of our results.