University of Guilan Computational Sciences and Engineering 2783-2503 4 2 2024 09 01 The k-order variations on the k-Fibonacci universal code for k ≥ 4 351 360 9167 10.22124/cse.2025.31829.1126 EN Mansour Hashemi Baragoori Faculty of mathematical sciences, University of guilan, Iran Journal Article 2025 08 30 In the current paper, first we study the <em>k−</em>order variations on the <em>k</em>-Fibonacci universal code for <em>k ≥</em> 4 (denoted by ) and get Table 3. Also in Tables 1 and 2, we obtain the <em>k</em>-Fibonacci representation and the <em>k</em>-Fibonacci code for <em>k ≥</em> 4 and 1 <em>≤ n ≤</em> 50, respectively. Finally, we examine a new blocking algorithm using <em>k−</em>Fibonacci code and Gopala-Hemachandra code. Gopala-Hemachandra k-Fibonacci sequence Coding Theory https://cse.guilan.ac.ir/article_9167_9878563d55aefeba44437315d47a1a13.pdf