Space-Efficient Informational Redundancy

DOI10.1007/978-3-540-92182-0_41zbMATH Open1183.68307OpenAlexW32976117MaRDI QIDQ3596740FDOQ3596740

Authors: Christian Glaßer 

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_41

Recommendations

• Space-efficient informational redundancy
• Space-Conscious Compression
• scientific article; zbMATH DE number 812532
• On the Redundancy of Succinct Data Structures
• scientific article; zbMATH DE number 3463524
• On Optimal Redundancy
• Space bounds for reliable storage: fundamental limits of coding
• An Information-Theoretic Analysis of Deduplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Ramsey theory (05D10)

Cited In (1)

• Space-efficient informational redundancy

This page was built for publication: Space-Efficient Informational Redundancy

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