Search arXivSearch

arXiv subjects

Haode Yan

Publications and source records attributed to Haode Yan.

2 recordsLinked to original sources

The Cross-Correlation Distribution of the Niho-Type Decimation $d=4(2^m-1)+1$

The cross-correlation problem is a classical problem in sequence design. In this paper, we determine the cross-correlation distribution of the Niho-type decimation $d=4(2^m-1)+1$ over $\mathbb F_{2^{2m}}$ for every positive integer $m$. With $q=2^m$, this is equivalent to determining the distribution of the number of roots in $U_{q+1}$ of $f_a(x)=x^7+ax^4+\bar a x^3+1$ for $a\in\mathbb F_{q^2}$, where $U_{q+1}=\{x\in\mathbb F_{q^2}:x^{q+1}=1\}$. The main difficulty is to count the four-element subsets of $U_{q+1}$ that may occur as root sets of $f_a$. We normalize such subsets by their product and study the resulting condition through the associated resolvent. This reduces the required enumeration to several equations over $\mathbb F_q$, which are evaluated by character sums and Kloosterman sums. The remaining mixed Kloosterman sum is related to a Kloosterman sum over $\mathbb F_{2^{2m}}$ and is evaluated using a theorem of Carlitz. Consequently, we obtain explicit formulas for all the frequencies in the cross-correlation distribution.

cs.IT

Counterexamples to Charpin's Conjecture on BCH codes

We construct an infinite family of $q$-ary primitive narrow-sense BCH codes whose minimum distance strictly exceeds the Bose distance; in fact, the gap between the two can be arbitrarily large as the length of the code tends to infinity. The key idea is to embed these BCH codes in a suitably large punctured generalized Reed--Muller code, whose codeword weights obey divisibility conditions supplied by Ax's theorem. This divisibility forces the minimum distance of the BCH codes far above the Bose distance. In particular, our family disproves a longstanding conjecture of Charpin asserting that this difference is at most four.

cs.IT