Related papers: Gold type codes of higher relative dimension
Some new Kasami type codes of higher relative dimension is introduced. Their weight distribution is determined.
Linearized Reed-Solomon codes are defined. Higher weight distribution of those codes are determined.
A new kind of Convolutional Codes generalizing Goppa Codes is proposed. This provides a systematic method for constructing convolutional codes with prefixed properties. In particular, examples of Maximum-Distance Separable (MDS)…
In this paper, a family of five-weight reducible cyclic codes is presented. Furthermore, the weight distribution of these cyclic codes is determined, which follows from the determination of value distributions of certain exponential sums.
Minimal codes are a class of linear codes which gained interest in the last years, thanks to their connections to secret sharing schemes. In this paper we provide the weight distribution and the parameters of families of minimal codes…
This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.
The duals of cyclic codes with two zeros have been extensively studied, and their weight distributions have recently been evaluated in some cases. In this note, we determine the weight distribution of a certain new class of such codes by…
The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we…
In this work, we determine new linear equations for the weight distribution of linear codes over finite chain rings. The identities are determined by counting the number of some special submatrices of the parity-check matrix of the code.…
In this paper, a family of six-weight cyclic codes over GF(p) whose duals have two zeros is presented, where p is an odd prime. And the weight distribution of these cyclic codes is determined.
Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three zeros. Recently, \cite{Y-X-D12}…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many…
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…
Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related…
New infinite families of quantum symmetric and asymmetric codes are constructed. Several of these are MDS. The codes obtained are shown to have parameters which are better than previously known. A number of known codes are special cases of…
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.
Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…
In this paper, a family of reducible cyclic codes over GF(p) whose duals have four zeros is presented, where p is an odd prime. Furthermore, the weight distribution of these cyclic codes is determined.
We introduce a new class of non-standard variable-length codes, called adaptive codes. This class of codes associates a variable-length codeword to the symbol being encoded depending on the previous symbols in the input data string. An…