3,557 research outputs found
Weight distributions of cyclic codes with respect to pairwise coprime order elements
Let be an extension of a finite field with . Let
each be of order in and for .
We define a cyclic code over by
where
and . In this paper,
we present a method to compute the weights of . Further, we determine the weight distributions of the cyclic codes
and .Comment: 18 pages. arXiv admin note: substantial text overlap with
arXiv:1306.527
Weight distribution of two classes of cyclic codes with respect to two distinct order elements
Cyclic codes are an interesting type of linear codes and have wide
applications in communication and storage systems due to their efficient
encoding and decoding algorithms. Cyclic codes have been studied for many
years, but their weight distribution are known only for a few cases. In this
paper, let be an extension of a finite field and ,
we determine the weight distribution of the cyclic codes c(a, b)=(\mbox {Tr}_{r/q}(ag_1^0+bg_2^0), \ldots, \mbox
{Tr}_{r/q}(ag_1^{n-1}+bg_2^{n-1})), g_1, g_2\in \Bbb F_r, in the following
two cases: (1) \ord(g_1)=n, n|r-1 and ; (2) \ord(g_1)=n,
, \ord(g_2)=\frac n 2, and
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
We introduce the notion of the stopping redundancy hierarchy of a linear
block code as a measure of the trade-off between performance and complexity of
iterative decoding for the binary erasure channel. We derive lower and upper
bounds for the stopping redundancy hierarchy via Lovasz's Local Lemma and
Bonferroni-type inequalities, and specialize them for codes with cyclic
parity-check matrices. Based on the observed properties of parity-check
matrices with good stopping redundancy characteristics, we develop a novel
decoding technique, termed automorphism group decoding, that combines iterative
message passing and permutation decoding. We also present bounds on the
smallest number of permutations of an automorphism group decoder needed to
correct any set of erasures up to a prescribed size. Simulation results
demonstrate that for a large number of algebraic codes, the performance of the
new decoding method is close to that of maximum likelihood decoding.Comment: 40 pages, 6 figures, 10 tables, submitted to IEEE Transactions on
Information Theor
Recent progress on weight distributions of cyclic codes over finite fields
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. In coding theory it is often desirable to know the weight distribution of a cyclic code to estimate the error correcting capability and error probability. In this paper, we present the recent progress on the weight distributions of cyclic codes over finite fields, which had been determined by exponential sums. The cyclic codes with few weights which are very useful are discussed and their existence conditions are listed. Furthermore, we discuss the more general case of constacyclic codes and give some equivalences to characterize their weight distributions
- β¦