Open Source
Correlation distribution for a class of Niho exponents via self-conjugate-reciprocal polynomials and Kloosterman sums
arXiv math.IT0 views
arXiv:2611.17506v1 Announce Type: new Abstract: Let $q=2^m$ for an even $m\geq 6$ and let $d=s(q-1)+1$ with $4s\equiv5\pmod{q+1}$. In this paper, the correlation distribution between a binary m-sequence of period $q^2-1$ and its $d$-decimation is considered. The cross-correlation function takes seven values $q(i-1)-1$ for $0\leq i\leq 6$, and we determine their frequencies based on the study of low-degree self-conjugate-reciprocal polynomials and three mixed Kloosterman sums, which are finally expressed in terms of $K_m(1)$ and $K_m(\omega)$, where $K_m(\cdot)$ is the Kloomsterman sum on the finite field $\mathbb{F}_q$ and $\omega$ is a primitive element of $\mathbb{F}_4$.
Source:https://arxiv.org/abs/2611.17506PreviousBeyond Curiosity: Habit and Organizational Learning Capability as Predictors of Shadow AINextToward the Minimal Set of Information Inequalities in Regenerating Codes: An Algebraic Approach
Related posts
What Should World Models Forget? Stratified Retention for Continual Adaptation
0arXiv eess.SP
uhd-rfsoc: Bringing Off-the-Shelf RFSoC Boards to Unmodified UHD Applications
0arXiv eess.SP
An Axiomatic Framework for Reinforcement Learning in Open Multi-Agent Systems
0arXiv cs.MA
From Facts to Insights: A Persona-Driven Dual Memory Framework and Dataset for Role-Playing Agents
0arXiv cs.MA
A Taxonomy of Real Faults in Hybrid Quantum-Classical Architectures
0arXiv cs.SE
SyclKittens: A Tile Programming Model for Programmers and Coding Agents on Intel GPUs
0arXiv cs.DC