Universal codes of the natural numbers

Yuval Filmus

doi:10.2168/LMCS-9(3:7)2013

Universal codes of the natural numbers

Yuval Filmus

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how to construct effectively a code better than a given sequence of codes, in a certain precise sense. As an application, we prove that the existence of a scale of codes (a well-ordered set of codes which contains a code better than any given code) is independent of ZFC.

Original language	English
Article number	7
Journal	Logical Methods in Computer Science
Volume	9
Issue number	3
DOIs	https://doi.org/10.2168/LMCS-9(3:7)2013
State	Published - 29 Aug 2013
Externally published	Yes

Keywords

Kraft's inequality
Universal codes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.2168/LMCS-9(3:7)2013

Cite this

@article{f8d7e882714e42e18bc36433c245bfd4,

title = "Universal codes of the natural numbers",

abstract = "A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how to construct effectively a code better than a given sequence of codes, in a certain precise sense. As an application, we prove that the existence of a scale of codes (a well-ordered set of codes which contains a code better than any given code) is independent of ZFC.",

keywords = "Kraft's inequality, Universal codes",

author = "Yuval Filmus",

year = "2013",

month = aug,

day = "29",

doi = "10.2168/LMCS-9(3:7)2013",

language = "אנגלית",

volume = "9",

number = "3",

}

TY - JOUR

T1 - Universal codes of the natural numbers

AU - Filmus, Yuval

PY - 2013/8/29

Y1 - 2013/8/29

N2 - A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how to construct effectively a code better than a given sequence of codes, in a certain precise sense. As an application, we prove that the existence of a scale of codes (a well-ordered set of codes which contains a code better than any given code) is independent of ZFC.

AB - A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how to construct effectively a code better than a given sequence of codes, in a certain precise sense. As an application, we prove that the existence of a scale of codes (a well-ordered set of codes which contains a code better than any given code) is independent of ZFC.

KW - Kraft's inequality

KW - Universal codes

UR - http://www.scopus.com/inward/record.url?scp=84884894726&partnerID=8YFLogxK

U2 - 10.2168/LMCS-9(3:7)2013

DO - 10.2168/LMCS-9(3:7)2013

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84884894726

SN - 1860-5974

VL - 9

JO - Logical Methods in Computer Science

JF - Logical Methods in Computer Science

IS - 3

M1 - 7

ER -

Universal codes of the natural numbers

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this