Document Type : Original Article

Author

• Mansour Hashemi Baragoori

Faculty of mathematical sciences, University of guilan, Iran

Abstract

In the current paper, first we study the k−order variations on the k-Fibonacci universal code

for k ≥ 4 (denoted by GHa(k,n) ) and get Tables GHa(k,n) for −10 ≤ a≤−2 and 1 ≤ n ≤ 50.

Also, we examine a new blocking algorithm using k−Fibonacci code and Gopala-Hemachandra

code.

Keywords

• Gopala-Hemachandra
• k-Fibonacci sequence
• Coding Theory