A New Family of Binary Sequences via Elliptic Function Fields over Finite Fields of Odd Characteristics
By: Xiaofeng Liu, Jun Zhang, Fang-Wei Fu
Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to the cyclic elliptic function fields with odd characteristic by using the quadratic residue map $η$ instead of the trace map used therein. For any cyclic elliptic function field with $q+1+t$ rational points and any positive integer $d$ with $\gcd(d, q+1+t)=1$, we construct a new family of binary sequences of length $q+1+t$, size $q^{d-1}-1$, balance upper bounded by $(d+1)\cdot\lfloor2\sqrt{q}\rfloor+|t|+d,$ the correlation upper bounded by $(2d+1)\cdot\lfloor2\sqrt{q}\rfloor+|t|+2d$ and the linear complexity lower bounded by $\frac{q+1+2t-d-(d+1)\cdot\lfloor2\sqrt{q}\rfloor}{d+d\cdot\lfloor2\sqrt{q}\rfloor}$ where $\lfloor x\rfloor$ stands for the integer part of $x\in\mathbb{R}$.
Similar Papers
A New Family of Binary Sequences via Elliptic Function Fields over Finite Fields of Odd Characteristics
Information Theory
Makes secret codes harder to break.
New Constructions of Optimal $(r,δ)$-LRCs via Algebraic Function Fields
Information Theory
Stores more data reliably in computers.
Optimal Secure Coded Distributed Computation over all Fields
Information Theory
Makes computer networks share data more safely.