再论Gopala-Hemachandra码
Gopala-Hemachandra codes revisited
摘要:
Gopala-Hemachandra码是Fibonacci通用码的变体,在密码学和数据压缩中有应用。我们证明了对于$a=-2,-3$和$-4$,对于任意整数$n \geq 1$,$GH_{a}(n)$码总是存在的,因此是通用码.我们开发了两个新的算法来确定是否存在GH代码为一组给定的参数$a$和$n$。在2010年,Basu和Prasad通过实验证明了在$1 \leq n \leq 100$和$1 \leq k \leq 16$的范围内,最多存在连续整数$k$,其中$GH_{-(4+k)}(n)$不存在。我们把他们的数值结果转化为一个数学定理,并证明它的有效性远远超出了他们所考虑的有限范围。
英文摘要:
Gopala-Hemachandra codes are a variation of the Fibonacci universal code and have applications in cryptography and data compression. We show that $GH_{a}(n)$ codes always exist for $a=-2,-3$ and $-4$ for any integer $n \geq 1$ and hence are universal codes. We develop two new algorithms to determine whether a GH code exists for a given set of parameters $a$ and $n$. In 2010, Basu and Prasad showed experimentally that in the range $1 \leq n \leq 100$ and $1 \leq k \leq 16$, there are at most $k$ consecutive integers for which $GH_{-(4+k)}(n)$ does not exist. We turn their numerical result into a mathematical theorem and show that it is valid well beyond the limited range considered by them.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。