19,512 research outputs found

    Cyclotomic Constructions of Cyclic Codes with Length Being the Product of Two Primes

    Full text link
    Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made. In this paper, three types of generalized cyclotomy of order two and three classes of cyclic codes of length n1n2n_1n_2 and dimension (n1n2+1)/2(n_1n_2+1)/2 are presented and analysed, where n1n_1 and n2n_2 are two distinct primes. Bounds on their minimum odd-like weight are also proved. The three constructions produce the best cyclic codes in certain cases.Comment: 19 page

    On the weight distributions of several classes of cyclic codes from APN monomials

    Get PDF
    Let m3m\geq 3 be an odd integer and pp be an odd prime. % with p1=2rhp-1=2^rh, where hh is an odd integer. In this paper, many classes of three-weight cyclic codes over Fp\mathbb{F}_{p} are presented via an examination of the condition for the cyclic codes C(1,d)\mathcal{C}_{(1,d)} and C(1,e)\mathcal{C}_{(1,e)}, which have parity-check polynomials m1(x)md(x)m_1(x)m_d(x) and m1(x)me(x)m_1(x)m_e(x) respectively, to have the same weight distribution, where mi(x)m_i(x) is the minimal polynomial of πi\pi^{-i} over Fp\mathbb{F}_{p} for a primitive element π\pi of Fpm\mathbb{F}_{p^m}. %For p=3p=3, the duals of five classes of the proposed cyclic codes are optimal in the sense that they meet certain bounds on linear codes. Furthermore, for p3(mod4)p\equiv 3 \pmod{4} and positive integers ee such that there exist integers kk with gcd(m,k)=1\gcd(m,k)=1 and τ{0,1,,m1}\tau\in\{0,1,\cdots, m-1\} satisfying (pk+1)e2pτ(modpm1)(p^k+1)\cdot e\equiv 2 p^{\tau}\pmod{p^m-1}, the value distributions of the two exponential sums T(a,b)=\sum\limits_{x\in \mathbb{F}_{p^m}}\omega^{\Tr(ax+bx^e)} and S(a,b,c)=\sum\limits_{x\in \mathbb{F}_{p^m}}\omega^{\Tr(ax+bx^e+cx^s)}, where s=(pm1)/2s=(p^m-1)/2, are settled. As an application, the value distribution of S(a,b,c)S(a,b,c) is utilized to investigate the weight distribution of the cyclic codes C(1,e,s)\mathcal{C}_{(1,e,s)} with parity-check polynomial m1(x)me(x)ms(x)m_1(x)m_e(x)m_s(x). In the case of p=3p=3 and even ee satisfying the above condition, the duals of the cyclic codes C(1,e,s)\mathcal{C}_{(1,e,s)} have the optimal minimum distance

    MDS array codes with independent parity symbols

    Get PDF
    A new family of maximum distance separable (MDS) array codes is presented. The code arrays contain p information columns and r independent parity columns, each column consisting of p-1 bits, where p is a prime. We extend a previously known construction for the case r=2 to three and more parity columns. It is shown that when r=3 such extension is possible for any prime p. For larger values of r, we give necessary and sufficient conditions for our codes to be MDS, and then prove that if p belongs to a certain class of primes these conditions are satisfied up to r ≤ 8. One of the advantages of the new codes is that encoding and decoding may be accomplished using simple cyclic shifts and XOR operations on the columns of the code array. We develop efficient decoding procedures for the case of two- and three-column errors. This again extends the previously known results for the case of a single-column error. Another primary advantage of our codes is related to the problem of efficient information updates. We present upper and lower bounds on the average number of parity bits which have to be updated in an MDS code over GF (2^m), following an update in a single information bit. This average number is of importance in many storage applications which require frequent updates of information. We show that the upper bound obtained from our codes is close to the lower bound and, most importantly, does not depend on the size of the code symbols

    Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes

    Full text link
    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

    Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures

    Full text link
    Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers, which makes the systems computationally expensive and difficult to maintain. Here, we study linear locally repairable codes over the binary field, tolerating multiple local erasures. We derive bounds on the minimum distance on such codes, and give examples of LRCs achieving these bounds. Our main technical tools come from matroid theory, and as a byproduct of our proofs, we show that the lattice of cyclic flats of a simple binary matroid is atomic.Comment: 9 pages, 1 figure. Parts of this paper were presented at IZS 2018. This extended arxiv version includes corrected versions of Theorem 1.4 and Proposition 6 that appeared in the IZS 2018 proceeding
    corecore