Searcharxiv⌕ Search

arXiv subjects

Maosheng Xiong

Publications and source records attributed to Maosheng Xiong.

46 records · Page 3Linked to original sources
arXiv2013

Three New Families of Zero-difference Balanced Functions with Applications

Zero-difference balanced (ZDB) functions integrate a number of subjects in combinatorics and algebra, and have many applications in coding theory, cryptography and communications engineering. In this paper, three new families of ZDB functions are presented. The first construction, inspired by the recent work \cite{Cai13}, gives ZDB functions defined on the abelian groups $(\gf(q_1) \times \cdots \times \gf(q_k), +)$ with new and flexible parameters. The other two constructions are based on $2$-cyclotomic cosets and yield ZDB functions on $\Z_n$ with new parameters. The parameters of optimal constant composition codes, optimal and perfect difference systems of sets obtained from these new families of ZDB functions are also summarized.

cs.IT↗
arXiv2013

On a question of Babadi and Tarokh II

In this paper we continue to study a question proposed by Babadi and Tarokh \cite{ba2} on the mysterious randomness of Gold sequences. Upon improving their result, we establish the randomness of product of pseudorandom matrices formed from two linear block codes with respect to the empirical spectral distribution, if the dual distance of both codes is at least 5, hence providing an affirmative answer to the question.

cs.IT↗
arXiv2013

On a question of Babadi and Tarokh

In a recent remarkable paper, Babadi and Tarokh proved the "randomness" of sequences arising from binary linear block codes in the sense of spectral distribution, provided that their dual distances are sufficiently large. However, numerical experiments conducted by the authors revealed that Gold sequences which have dual distance 5 also satisfy such randomness property. Hence the interesting question was raised as to whether or not the stringent requirement of large dual distances can be relaxed in the theorem in order to explain the randomness of Gold sequences. This paper improves their result on several fronts and provides an affirmative answer to this question.

math.NT↗
arXiv2013

Distribution of zeta zeroes for abelian covers of algebraic curves over a finite field

For a function field $k$ over a finite field with $\mathbb{F}_q$ as the field of constant, and a finite abelian group $G$ whose exponent is divisible by $q-1$, we study the distribution of zeta zeroes for a random $G$-extension of $k$, ordered by the degree of conductors. We prove that when the degree goes to infinity, the number of zeta zeroes lying in a prescribed arc is uniformly distributed and the variance follows a Gaussian distribution.

math.NT↗
arXiv2013

The Weight Enumerator of Three Families of Cyclic Codes

Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their dual codes have been a subject of study for many years. However, their weight distributions are known only for a very small number of cases. In general the calculation of the weight distribution of cyclic codes is heavily based on the evaluation of some exponential sums over finite fields. Very recently, Li, Hu, Feng and Ge studied a class of $p$-ary cyclic codes of length $p^{2m}-1$, where $p$ is a prime and $m$ is odd. They determined the weight distribution of this class of cyclic codes by establishing a connection between the involved exponential sums with the spectrum of Hermitian forms graphs. In this paper, this class of $p$-ary cyclic codes is generalized and the weight distribution of the generalized cyclic codes is settled for both even $m$ and odd $m$ alone with the idea of Li, Hu, Feng, and Ge. The weight distributions of two related families of cyclic codes are also determined.

cs.IT↗
arXiv2013

Weight Distribution of a Class of Cyclic Codes with Arbitrary Number of Zeros

Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many years. It is in general hard to determine the weight distribution of linear codes. In this paper, a class of cyclic codes with any number of zeros are described and their weight distributions are determined.

cs.IT↗
arXiv2012

The weight distributions of a class of cyclic codes III

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we solve one more special case. The problem of finding the weight distribution is transformed into a problem of evaluating certain character sums over finite fields, which in turn can be solved by using the Jacobi sums directly.

math.NT↗
arXiv2012

The weight distributions of a class of cyclic codes II

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we use the method developed before to solve one more special case. We make extensive use of standard tools in number theory such as characters of finite fields, the Gauss sums and the Jacobi sums. The problem of finding the weight distribution is transformed into a problem of evaluating certain character sums over finite fields, which turns out to be associated with counting the number of points on some elliptic curves over finite fields. We also treat the special case that the characteristic of the finite field is 2.

math.NT↗
arXiv2011

The weight distributions of a class of cyclic codes

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special case. We make extensive use of standard tools in number theory such as characters of finite fields, the Gauss sums and the Jacobi sums to transform the problem of finding the weight distribution into a problem of evaluating certain character sums over finite fields, which on the special case is related with counting the number of points on some elliptic curves over finite fields. Other cases are also possible by this method.

math.NT↗