SearcharxivSearch

arXiv subjects

Binbin Pang

Publications and source records attributed to Binbin Pang.

3 recordsLinked to original sources

On cyclic codes of length $2^e$ over finite fields

Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length $n=2^e$ and dimension $k=2^{e-1}$. Clearly, Ding's construction is not hold in this place. We describe two new types of generalized cyclotomy of order two, which are different from Ding's. Furthermore, we study two classes of cyclic codes of length $n$ and dimension $k$. We get the enumeration of these cyclic codes. What's more, all of the codes from our construction are among the best cyclic codes. Furthermore, we study the hull of cyclic codes of length $n$ over $\mathbb{F}_q$. We obtain the range of $\ell=\dim({\rm Hull}(C))$. We construct and enumerate cyclic codes of length $n$ having hull of given dimension.

cs.IT

Some new bounds on LCD codes over finite fields

In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD$(n,2)$ over $\mathbb{F}_3$ and $\mathbb{F}_4$. We study the bound of LCD codes over $\mathbb{F}_q$.

cs.IT

The reversible negacyclic codes over finite fields

In this paper, by investigating the factor of the $x^n+1$, we deduce that the structure of the reversible negacyclic code over the finite field $\mathbb{F}_{q}$, where $q$ is an odd prime power. Though studying $q-$cyclotomic cosets modulo $2n$, we obtain the parameters of negacyclic BCH code of length $n=\frac{q^\ell+1}{2}$ , $n=\frac{q^m-1}{2(q-1)}$ and $n=\frac{q^{t\cdot2^τ}-1}{2(q^t+1)}$. Some optimal linear codes from negacyclic codes are given. Finally, we discuss a class of MDS LCD negacyclic codes.

cs.IT