Main Article Content
For a given arbitrary list of integer numbers, in general there is no known single universal code which is an overall optimum in the sense of representing the whole list with the shortest average codeword length. This is the motivation in this paper to introduce a class of adaptive universal codes based on pattern codes, for integer representation. A construction of adaptive universal codes is given, which is based on Fibonacci codes. This construction is shown to perform well over a wider range of integer values in comparison to known universal code constructions.
How to Cite
Lima, M. J. de C., & da Rocha Jr., V. C. (2013). Adaptive Universal Codes for Integer Representation. Journal of Communication and Information Systems, 28(1). https://doi.org/10.14209/jcis.2013.2
Authors who publish in this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).