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）上的三项式构造二元循环码

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

有限域上长为2mpn 的负循环码

设F_q 是奇数阶有限域. 本文主要借助X^2mpn+1 在F_q 上的不可约因式分解来确定有限域F_q上所有长为2^mpⁿ 的负循环码和自对偶的负循环码的生成多项式, 这里p 是q-1 的奇素因子, m 和n是正整数.     

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.     

Improved lower bounds on sizes of single-error correcting codes

A construction of codes of length n = q + 1 and minimum Hamming distance 3 over is given. Substitution of the derived codes into a concatenation construction yields nonlinear binary single-error correcting codes with better than known parameters. In particular, new binary single-error correcting codes having more codewords than the best previously known in the range n ≤ 512 are obtained for the lengths 64–66, 128–133, 256–262, and 512.