Minimal quadratic residue cyclic codes of length 2 n

LetF be a finite field of prime power orderq(odd) and the multiplicative order ofq modulo 2 ⁿ (n>1) be ?(2 ⁿ )/2. Ifn>3, thenq is odd number(prime or prime power) of the form 8m±3. Ifq=8m?3, then the ring $$R_{2^n } = F\left[ x \right]/< x^{2^n } - 1 > $$ has 2n primitive idempotents. The explicit expressions for these primitive idempotents are obtained and the minimal QR cyclic codes of length 2 ⁿ generated by these idempotents are completely described. Ifq=8m+3 then the expressions for the 2n?1 primitive idempotents ofR ₂ ⁿ are obtained. The generating polynomials and the upper bounds of the minimum distance of minimal QR cyclic codes generated by these 2n?1 idempotents are also obtained. The casen=2, 3 is dealt separately.     

Minimal cyclic codes of length pq

Explicit expressions for all the 3n+2 primitive idempotents in the ring R_pⁿq=GF(ℓ)[x]/(x^pnq−1), where p,q,ℓ are distinct odd primes, ℓ is a primitive root modulo pⁿ and q both, , are obtained. The dimension, generating polynomials and the minimum distance of the minimal cyclic codes of length pⁿq over GF(ℓ) are also discussed.     

The weight distributions of irreducible cyclic codes of length

Let m be a positive integer and q be an odd prime power. In this paper, the weight distributions of all the irreducible cyclic codes of length 2^m over F_q are determined explicitly.     

Minimal zero sum sequences of length four over finite cyclic groups

Text

Let G be a finite cyclic group. Every sequence S over G can be written in the form S=(n₁g)⋅…⋅(nlg) where g∈G and n₁,…,nl∈[1,ord(g)], and the index ind(S) of S is defined to be the minimum of (n₁+?+nl)/ord(g) over all possible g∈G such that 〈g〉=〈supp(S)〉. The problem regarding the index of sequences has been studied in a series of papers, and a main focus is to determine sequences of index 1. In the present paper, we show that if G is a cyclic of prime power order such that gcd(|G|,6)=1, then every minimal zero-sum sequence of length 4 has index 1.

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=BC7josX_xVs.     

Minimal quadratic residue cyclic codes of lengthp n(p odd prime)

The explicit expressions for the 2n + 1 primitive idempotents in $R_{p^ - } = F[x]/< x^{p^ - } - 1 > $ , whereF is the field of prime power orderq and the multiplicative order ofq modulop ⁿ is ?(p ⁿ)/2 (n ≥ 1 andp is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of lengthp ⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length overGF(q)(q = 2, 3, ...) are obtained.     

Quasi-cyclic codes with cyclic constituent codes

Ling and Solé [S. Ling, P. Solé, On the algebraic structure of quasi-cyclic codes I: Finite fields, IEEE Trans. Inform. Theory 47 (2001) 2751–2760] showed that every quasi-cyclic code C is constructed from shorter linear codes which are called the constituent codes of C. Given a quasi-cyclic code C of length ℓm and index ℓ with m being pairwise coprime to ℓ and the order of the field C is over, if all its constituent codes are cyclic with their zeroes having full multiplicity, C is then shown to be equivalent to a cyclic code whose zeroes with their multiplicities are fully described in terms of the nonzeroes of the cyclic constituent codes. The general transformation to obtain the above-mentioned equivalent cyclic code is also explicitly given. The approach adopted here follows the approach used by A.M.A. Natividad [A.M.A. Natividad, PhD thesis, Department of Mathematics, University of Philippines Diliman, The Philippines, 2004] and uses the generalized discrete Fourier transform on the algebraic structure of the class of quasi-cyclic codes developed by Ling and Solé [S. Ling, P. Solé, On the algebraic structure of quasi-cyclic codes I: Finite fields, IEEE Trans. Inform. Theory 47 (2001) 2751–2760].     

Hermitian LCD codes from cyclic codes

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. It was proved that asymptotically good Hermitian LCD codes exist. The objective of this paper is to construct some cyclic Hermitian LCD codes over finite fields and analyse their parameters. The dimensions of these codes are settled and the lower bounds on their minimum distances are presented. Most Hermitian LCD codes presented in this paper are not BCH codes.     

Optimal cyclic (r,δ) locally repairable codes with unbounded length

Locally repairable codes with locality r (r-LRCs for short) were introduced by Gopalan et al. [1] to recover a failed node of the code from at most other r available nodes. And then $(r,\delta )$-locally repairable codes ($(r,\delta )$-LRCs for short) were produced by Prakash et al. [2] for tolerating multiple failed nodes. An r-LRC can be viewed as an $(r,2)$-LRC. An $(r,\delta )$-LRC is called optimal if it achieves the Singleton-type bound. It has been a great challenge to construct q-ary optimal $(r,\delta )$-LRCs with length much larger than q. Surprisingly, Luo et al. [3] presented a construction of q-ary optimal r-LRCs of minimum distances 3 and 4 with unbounded lengths (i.e., lengths of these codes are independent of q) via cyclic codes.In this paper, inspired by the work of [3], we firstly construct two classes of optimal cyclic $(r,\delta )$-LRCs with unbounded lengths and minimum distances $\delta +1$ or $\delta +2$, which generalize the results about the $\delta =2$ case given in [3]. Secondly, with a slightly stronger condition, we present a construction of optimal cyclic $(r,\delta )$-LRCs with unbounded length and larger minimum distance 2δ. Furthermore, when $\delta =3$, we give another class of optimal cyclic $(r,3)$-LRCs with unbounded length and minimum distance 6.     

AMDS symbol-pair codes from repeated-root cyclic codes

Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance is of significance in determining the error-correcting capability of a symbol-pair code. One of the central themes in symbol-pair coding theory is the constructions of symbol-pair codes with the largest possible minimum symbol-pair distance. Maximum distance separable (MDS) and almost maximum distance separable (AMDS) symbol-pair codes are optimal and sub-optimal regarding the Singleton bound, respectively. In this paper, six new classes of AMDS symbol-pair codes are explicitly constructed through repeated-root cyclic codes. Remarkably, one class of such codes has unbounded lengths and the minimum symbol-pair distance of another class can reach 13.     

MDS symbol-pair codes from repeated-root cyclic codes

Designs, Codes and Cryptography - Symbol-pair codes are proposed to protect against pair-errors in symbol-pair read channels. The research of symbol-pair codes with the largest possible minimum...     

Minimal codes in abelian group algebras

In this paper we show that two minimal codes $\text{M}$₁ and $\text{M}$₂ in the group algebra $\text{F}$₂[G] have the same (Hamming) weight distribution if and only if there exists an automorphism θ of G whose linear extension to $\text{F}$₂[G] maps $\text{M}$₁ onto $\text{M}$₂. If θ(M₁) = M₂, then $\text{M}$₁ and $\text{M}$₂ are called equivalent. We also show that there are exactly τ(l) inequivalent minimal codes in $\text{F}$₂[G], where ? is the exponent of G, and τ(?) is the number of divisors of ?.     

Minimal linear codes from Maiorana-McFarland functions

Minimal linear codes have important applications in secret sharing schemes and secure multi-party computation, etc. In this paper, we study the minimality of a kind of linear codes over $\mathrm{GF}(p)$ from Maiorana-McFarland functions. We first obtain a new sufficient condition for this kind of linear codes to be minimal without analyzing the weights of its codewords, which is a generalization of some works given by Ding et al. in 2015. Using this condition, it is easy to verify that such minimal linear codes satisfy $\frac{w_{\min }}{w_{\max }}\le \frac{p-1}{p}$ for any prime p, where $w_{\min }$ and $w_{\max }$ denote the minimum and maximum nonzero weights in a code, respectively. Then, by selecting the subsets of $\mathrm{GF}{(p)}^s$, we present two new infinite families of minimal linear codes with $\frac{w_{\min }}{w_{\max }}\le \frac{p-1}{p}$ for any prime p. In addition, the weight distributions of the presented linear codes are determined in terms of Krawtchouk polynomials or partial spreads.     

Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings

Let $R$ be the Galois ring $GR(p^k,s)$ of characteristic $p^k$ and cardinality $p^{sk}$. Firstly, we give all primitive idempotent generators of irreducible cyclic codes of length $n$ over $R$, and a $p$-adic integer ring with $gcd(p,n)=1$. Secondly, we obtain all primitive idempotents of all irreducible cyclic codes of length $r{l}^m$ over $R$, where $r,l,$ and $t$ are three primes with $2?l$, $r|(q^t?1)$, $l^v\parallel (q^t?1)$ and $gcd(rl,q(q?1))=1$. Finally, as applications, weight distributions of all irreducible cyclic codes for $t=2$ and generator polynomials of self-dual cyclic codes of length $l^m$ and $r{l}^m$ over $R$ are given.     

On cyclic algebraic-geometry codes

In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms. We prove that cyclic algebraic geometry codes constructed in this way are closely related to cyclic extensions. We also give a detailed study of the monomial equivalence of cyclic algebraic geometry codes constructed with our method in the case of a rational function field.     

Modular andp-adic cyclic codes

This paper presents some basic theorems giving the structure of cyclic codes of lengthn over the ring of integers modulop ^a and over thep-adic numbers, wherep is a prime not dividingn. An especially interesting example is the 2-adic cyclic code of length 7 with generator polynomialX ³ +X ² +(–1)X–1, where satisfies ² - + 2 = 0. This is the 2-adic generalization of both the binary Hamming code and the quaternary octacode (the latter being equivalent to the Nordstrom-Robinson code). Other examples include the 2-adic Golay code of length 24 and the 3-adic Golay code of length 12.     

Three-dimensional cyclic Fire codes

Three-dimensional cyclic array codes over F _q that can correct single three-dimensional bursts (or clusters) of errors are considered. The class cyclic three-dimensional burst-error-correcting array codes, called three-dimensional Fire codes, is constructed. Several important properties such as the burst-error-correcting capability and the positions of the parity-check symbols are presented. Also, encoding and decoding algorithms are given.