相关论文: On diameter perfect constant-weight ternary codes
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…
For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…
We study the performance of ternary isodual codes which are not self-dual and ternary self-dual codes, as measured by the decoding error probability in bounded distance decoding. We compare the performance of ternary double circulant and…
Absolute coset leaders were first proposed by the authors which have advantages in constructing binary LCD BCH codes. As a continue work, in this paper we focus on ternary linear codes. Firstly, we find the largest, second largest, and…
A multifold $1$-perfect code ($1$-perfect code for list decoding) in any graph is a set $C$ of vertices such that every vertex of the graph is at distance not more than $1$ from exactly $\mu$ elements of $C$. In $q$-ary Hamming graphs,…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
We present a memory and computation efficient ternary weight networks (TWNs) - with weights constrained to +1, 0 and -1. The Euclidian distance between full (float or double) precision weights and the ternary weights along with a scaling…
The problem to construct optimal conflict-avoiding codes of even lengths and the Hamming weight $3$ is completely settled. On the contrary, it is still open for odd lengths. It turns out that the prime lengths are the fundamental cases…
As a subclass of linear codes, cyclic codes have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, five families of three-weight…
Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…
Binary constant-weight codes have been extensively studied, due to both their numerous applications and to their theoretical significance. In particular, constant-weight codes have been proposed for error correction in store and forward. In…
The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of…
This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with…
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same size, is examined. A necessary and sufficient…