相关论文: On diameter perfect constant-weight ternary codes
Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first…
Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…
One peculiarity with deletion-correcting codes is that perfect $t$-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius $t$ with respect to the…
A binary poset code of codimension M (of cardinality 2^{N-M}, where N is the code length) can correct maximum M errors. All possible poset metrics that allow codes of codimension M to be M-, (M-1)- or (M-2)-perfect are described. Some…
We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…
Linear codes can be employed to construct authentication codes, which is an interesting area of cryptography. The parameters of the authentication codes depend on the complete weight enumerator of the underlying linear codes. In order to…
In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…
A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5983 such inequivalent perfect codes and 2165 extended perfect codes. Efficient…
Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of…
This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary…
Codes which attain the sphere packing bound are called perfect codes. The most important metrics in coding theory on which perfect codes are defined are the Hamming metric and the Johnson metric. While for the Hamming metric all perfect…
In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.
This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction.…
In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords…
Some properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 are presented for reference purposes.
Independent parallel q-ary symmetric channels are a suitable transmission model for several applications. The proposed weighted-Hamming metric is tailored to this setting and enables optimal decoding performance. We show that some…
Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…
In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…