A new recursive universal code of the positive integers

DOI10.1109/18.825850MaRDI QIDQ4503523zbMATH OpenOpenAlexFDO

Authors Hirosuke Yamamoto

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5c3150b4354a7083e1e585a5a307af10a5232a72

zbMATH Keywords

Elias \(\omega\) codelog-star functionprefix conditionrecursive universal code of the positive integersuniversal coding

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Universal codes of the natural numbers
• Universal coding of integers and unbounded search trees
• New binary coding results by circulants
• Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers
• New Binary Codes From Rational Function Fields
• On universal computably enumerable prefix codes
• On asymptotics of certain recurrences arising in universal coding
• New binary codes from a generalization of Zinoviev's technique
• Universal codes for finite sequences of integers drawn from a monotone distribution
• New results on integer programming for codes

Cited in

(8)

• Integer representation in the mixed base (2,3)
• Universal codes of the natural numbers
• Generalized unary coding
• Almost asymptotically optimal flag encoding of the integers
• Universal coding of integers and unbounded search trees
• Meta-Fibonacci Codes:Efficient Universal Coding of Natural Numbers
• Data coding by linear forms of numerical sequences
• Binary codes for locally homogeneous sequences

This page was built for publication: A new recursive universal code of the positive integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503523)