On bounded redundancy of universal codes (Q712553): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.spl.2012.07.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038485165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general definition of conditional information and its application to ergodic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Modern Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-based codes: a new class of universal lossless source codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5329487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal redundancy rates do not exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: A definition of conditional mutual information for arbitrary ensembles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Latest revision as of 18:22, 5 July 2024

scientific article
Language Label Description Also known as
English
On bounded redundancy of universal codes
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references