AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 5 of 16 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Let $q=2^n$ with $n=2m+1$ for an integer $m\ge1$, and let ${\mathbb F}_q$ be the finite field with $q$ elements. Let $W_n(x)=x^{2^m+3}$ be the Welch function on ${\mathbb F}_q$. For $1\le k\le n$ and $b\in{\mathbb F}_q$, denote by $N_{n,k}(b)$ the number of $k$-dimensional ${\mathbb F}_2$-subspaces $E$ of $\mathbb F}_q...
Let $q=2^n$ with $n\ge6$, and let $\mathbb{F}_q$ be the finite field with $q$ elements. For a subspace $E$ of $\mathbb{F}_q$, define \[ S(E)=\sum_{x\in E\setminus\{0\}}x^{-1}.\] Let $N_{n,k}$ denote the number of $k$-dimensional $\mathbb{F}_2$-subspaces $E$ for which $S(E)=0$. We prove that, if $k\ge3$ and $n\ge2k+1$,...
Let $N=2^k-1$, and let $S_{t,k}$ consist of the pairs $0\le a,b<N$ such that $a+b\equiv t\pmod N$ and $\wt(a)+\wt(b)<k$. The Tu--Deng bound $|S_{t,k}|\le 2^{k-1}$ has recently been proved. In this paper, we give a combinatorial proof of the equality criterion. If the $k$-bit cyclic word of $t$ has $Z$ zeros and $g_1,\l...
We determine all equality cases in the Tu--Deng bound $|S_{t,k}|\le 2^{k-1}$. If the $k$-bit cyclic word of $t$ has $R$ ones, $Z$ zeros, and cyclic one-gap lengths $g_1,\ldots,g_Z$, then equality holds if and only if $g_i\ge Z-1$ for every $i$. This resolves Conjecture~3.20 of Flori, Randriambololona, Cohen and Mesnage...
Let $s_2(n)$ be the binary sum-of-digits function and let $c_t$ be the natural density of the integers $n\ge0$ for which $s_2(n+t)\ge s_2(n)$. Earlier work of the author proved the universal exponential bound $$c_t-\frac12\ge 2^{-2s_2(t)-1},$$ thereby resolving Cusick's conjecture for every $t$. This estimate, however,...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.