{"title":"Variable length prefix (Δ, k)-codes","authors":"A. Anisimov, I. Zavadskyi","doi":"10.1109/BlackSeaCom.2015.7185083","DOIUrl":null,"url":null,"abstract":"A new perspective family of universal variable length prefix codes with a set of delimiters is introduced. The main seed of these codes is the binary representation of natural numbers in the two-base numeration system with the main radix 2 and the auxiliary radix 3. We construct extensions and generalizations of these (2,3)-codes, which we call (Δ, k)-codes. We prove that all (Δ, k)-codes are complete. Also for these codes we developed fast and efficient bit-wise and byte-wise encoding and decoding algorithms. Some representatives of (Δ, k)-codes family outperform the known closest to them Fibonacci codes either in text compression efficiency or in computational complexity.","PeriodicalId":162582,"journal":{"name":"2015 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BlackSeaCom.2015.7185083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A new perspective family of universal variable length prefix codes with a set of delimiters is introduced. The main seed of these codes is the binary representation of natural numbers in the two-base numeration system with the main radix 2 and the auxiliary radix 3. We construct extensions and generalizations of these (2,3)-codes, which we call (Δ, k)-codes. We prove that all (Δ, k)-codes are complete. Also for these codes we developed fast and efficient bit-wise and byte-wise encoding and decoding algorithms. Some representatives of (Δ, k)-codes family outperform the known closest to them Fibonacci codes either in text compression efficiency or in computational complexity.