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.     

Polyadic codes of prime power length

Polyadic codes constitute a special class of cyclic codes and are generalizations of quadratic residue codes, duadic codes, triadic codes, m-adic residue codes and split group codes, which have good error-correcting properties. In this paper, we give necessary and sufficient conditions for the existence of polyadic codes of prime power length. Examples of some good codes arising from the family of polyadic codes of prime power length are also given.     

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.     

Constructions of new families of nonbinary CSS codes

New families of good q-ary (q is an odd prime power) Calderbank-Shor-Steane (CSS) quantum codes derived from two distinct classical Bose-Chaudhuri-Hocquenghem (BCH) codes, not necessarily self-orthogonal, are constructed. These new families consist of CSS codes whose parameters are better than the ones available in the literature and comparable to the parameters of quantum BCH codes generated by applying the q-ary Steane’s enlargement of CSS codes.     

The Theory of Cyclic Codes and a Generalization to Additive Codes

We present a new approach to the theory of cyclic and constacyclic codes and generalize the theory to cover the family of additive (not necessarily linear) cyclic codes. The approach is based on the action of the Galois group (cyclotomic cosets). The conventional representation of cyclic codes as ideals in a factor ring of the polynomial ring is not needed.     

New classes of 2-weight cyclic codes

We introduce new classes of 2-weight cyclic codes which are direct sums of 1-weight irreducible cyclic codes      

利用有限域GF（2m）上的三项式构造二元循环码

循环码是一类特殊的线性码,由于循环码快速的编码和译码算法,它被广泛应用于消费电子,数据存储以及通信系统当中.在本文中,利用特征是偶数的有限域上的三项式构造出了两类二元循环码,我们不仅可以确定出这两类循环码最小距离的下界,而且这两类循环码在参数的选取上非常的灵活.     

On the p-Ranks and Characteristic Polynomials of Cyclic Difference Sets

In this paper, the p-ranks and characteristic polynomials of cyclic difference sets are derived by expanding the trace expressions of their characteristic sequences. Using this method, it is shown that the 3-ranks and characteristic polynomials of the Helleseth–Kumar–Martinsen (HKM) difference set and the Lin difference set can be easily obtained. Also, the p-rank of a Singer difference set is reviewed and the characteristic polynomial is calculated using our approach.     

Intersections of q-ary perfect codes

The intersections of q-ary perfect codes are under study. We prove that there exist two q-ary perfect codes C ₁ and C ₂ of length N = qn + 1 such that |C ₁ ? C ₂| = k · |P _i |/p for each k ∈ {0,..., p · K ? 2, p · K}, where q = p ^r , p is prime, r ≥ 1, $n = \tfrac{{q^{m - 1} - 1}}{{q - 1}}$ , m ≥ 2, |P _i | = p ^nr(q?2)+n , and K = p ^{n(2r?1)?r(m?1)}. We show also that there exist two q-ary perfect codes of length N which are intersected by p ^nr(q?3)+n codewords.     

环Fp+vFp上互补对偶常循环码

本文研究了环F_p+vF_p上互补对偶（1-2v）-常循环码.利用环F_p+vF_p上（1-2v）-常循环码的分解式C=vC_1-v ⊕（1-v）C_v,得到了环F_p+vF_p上互补对偶（1-2v）-常循环码的生成多项式.然后借助从F_p+vF_p到F_p²的Gray映射,证明了环F_p+vF_p上互补对偶（1-2v）-常循环码的Gray像是F_p的互补对偶循环码.     

Equivariant Cyclic Cohomology of H-Algebras

We define an equivariant K ₀-theory for Yetter–Drinfeld algebras over a Hopf algebra with an invertible antipode. We then show that this definition can be generalized to all Hopf-module algebras. We show that there exists a pairing, generalizing Connes pairing, between this theory and a suitably defined Hopf algebra equivariant cyclic cohomology theory.     

New Cyclic Difference Sets with Singer Parameters Constructed from d-Homogeneous Functions

In this paper, for a prime power q, new cyclic difference sets with Singer para- meters ((q ⁿ –1/q–1), (q ^n–1–1/q–1), (q ^n–2–1/q–1)) are constructed by using q-ary sequences (d-homogeneous functions) of period q ⁿ –1 and the generalization of GMW difference sets is proposed by combining the generation methods of d-form sequences and extended sequences. When q is a power of 3, new cyclic difference sets with Singer parameters ((q ⁿ –1/q–1), (q ^n–1–1/q–1), (q ^n–2–1/q–1)) are constructed from the ternary sequences of period q ⁿ –1 with ideal autocorrelation introduced by Helleseth, Kumar, and Martinsen.     

The polynomial degree of the Grassmannian G(1,n,q) of lines in finite projective space PG(n, q)

Let G: = G(1,n,q) denote the Grassmannian of lines in PG(n,q), embedded as a point-set in PG(N, q) with For n = 2 or 3 the characteristic function of the complement of G is contained in the linear code generated by characteristic functions of complements of n-flats in PG(N, q). In this paper we prove this to be true for all cases (n, q) with q = 2 and we conjecture this to be true for all remaining cases (n, q). We show that the exact polynomial degree of is for δ: = δ(n, q) = 0 or 1, and that the possibility δ = 1 is ruled out if the above conjecture is true. The result deg( for the binary cases (n,2) can be used to construct quantum codes by intersecting G with subspaces of dimension at least      

All q m -ary Cyclic Codes with Cyclic q-ary Image Are Known

We give a simpler presentation of recent work byLeonard, Séguin and Tang-Soh-Gunawan. Our methodsimply as a new result that even in the repeated-root casethere are no more q ^m -arycyclic codes with cyclic q-ary image than thosegiven by Séguin.