Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Injectivity w.r.t. Distribution of Elements in the Compressed Sequences Derived from Primitive Sequences over $Z/p^eZ$ (1303.0926v4)

Published 5 Mar 2013 in cs.IT and math.IT

Abstract: Let $p\geq3$ be a prime and $e\geq2$ an integer. Let $\sigma(x)$ be a primitive polynomial of degree $n$ over $Z/peZ$ and $G'(\sigma(x),pe)$ the set of primitive linear recurring sequences generated by $\sigma(x)$. A compressing map $\varphi$ on $Z/peZ$ naturally induces a map $\hat{\varphi}$ on $G'(\sigma(x),pe)$. For a subset $D$ of the image of $\varphi$,$\hat{\varphi}$ is called to be injective w.r.t. $D$-uniformity if the distribution of elements of $D$ in the compressed sequence implies all information of the original primitive sequence. In this correspondence, for at least $1-2(p-1)/(pn-1)$ of primitive polynomials of degree $n$, a clear criterion on $\varphi$ is obtained to decide whether $\hat{\varphi}$ is injective w.r.t. $D$-uniformity, and the majority of maps on $Z/peZ$ induce injective maps on $G'(\sigma(x),pe)$. Furthermore, a sufficient condition on $\varphi$ is given to ensure injectivity of $\hat{\varphi}$ w.r.t. $D$-uniformity. It follows from the sufficient condition that if $\sigma(x)$ is strongly primitive and the compressing map $\varphi(x)=f(x_{e-1})$, where $f(x_{e-1})$ is a permutation polynomial over $\mathbb{F}{p}$, then $\hat{\varphi}$ is injective w.r.t. $D$-uniformity for $\emptyset\neq D\subset\mathbb{F}{p}$. Moreover, we give three specific families of compressing maps which induce injective maps on $G'(\sigma(x),pe)$.

Citations (1)

Summary

We haven't generated a summary for this paper yet.