Studies on Gopala-Hemachandra codes and their applications / by Logan Childers.
| Author/creator | Childers, Logan author. |
| Other author | Gopalakrishnan, Krishnan, degree supervisor. |
| Other author | East Carolina University. Department of Computer Science. |
| Format | Theses and dissertations |
| Publication | [Greenville, N.C.] : [East Carolina University], 2020. |
| Description | 56 pages |
| Supplemental Content | Access via ScholarShip |
| Subjects |
| Summary | Gopala-Hemachandra codes are a variation of the Fibonacci universal code and have applications in data compression and cryptography. We study a specific parameterization of Gopala-Hemachandra codes and present several results pertaining to these codes. We show that GH_{a}(n) always exists for any n >= 1, when -2 >= a >= -4, meaning that these are universal codes. We develop two new algorithms to determine whether a GH code exists for a given a and n, and to construct them if they exist. We also prove that when a = -(4+k), where k >= 1, that there are at most k consecutive integers for which GH codes do not exist. In 2014, Nalli and Ozyilmaz proposed a stream cipher based on GH codes. We show that this cipher is insecure and provide experimental results on the performance of our program that cracks this cipher. |
| General note | Presented to the faculty of the Department of Computer Science |
| General note | Advisor: Krishnan Gopalakrishnan |
| General note | Title from PDF t.p. (viewed August 12, 2021). |
| Dissertation note | M.S. East Carolina University 2020. |
| Bibliography note | Includes bibliographical references. |
| Technical details | System requirements: Adobe Reader. |
| Technical details | Mode of access: World Wide Web. |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | Access Content Online | ✔ Available |