scientific article; zbMATH DE number 3463524

MaRDI QIDQ4048958zbMATH OpenFDO

Authors B. M. Fitingof

Publication date 1967

Full work available at URL http://mathnet.ru/eng/ppi/v3/i3/p28

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 3463523
• Optimal universal coding with respect to the maximal individual relative redundancy criterion
• Universal almost sure data compression
• A Method for the Construction of Minimum-Redundancy Codes
• scientific article; zbMATH DE number 3478758

Cited in

(41)

• Data compression using an ``imaginary sliding window
• An informational approach to the problem of compressing random processes
• Unconditional bases and bit-level compression
• About one formal schemes of information compression
• scientific article; zbMATH DE number 3478758 (Why is no real title available?)
• Polynomial representation of binary trees of entropy binary codes
• scientific article; zbMATH DE number 3463523 (Why is no real title available?)
• scientific article; zbMATH DE number 1983209 (Why is no real title available?)
• scientific article; zbMATH DE number 590411 (Why is no real title available?)
• scientific article; zbMATH DE number 3621627 (Why is no real title available?)
• Compression of quantum information
• scientific article; zbMATH DE number 3318548 (Why is no real title available?)
• scientific article; zbMATH DE number 3863086 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A theory of incremental compression
• Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression
• scientific article; zbMATH DE number 1543032 (Why is no real title available?)
• Bernstein polynomials and learning theory
• ?-Entropy data compression
• Epsilon Entropy and Data Compression
• scientific article; zbMATH DE number 5815903 (Why is no real title available?)
• Optimal random coding
• Minimax optimal universal codeword sets
• Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World
• Data compression by means of a ``book stack
• Data Compression for a Source with Markov Characteristics
• scientific article; zbMATH DE number 1984015 (Why is no real title available?)
• Information compression and Varshamov-Gilbert bound
• scientific article; zbMATH DE number 3904487 (Why is no real title available?)
• Statistical mechanics of the data compression theorem
• Quantitative information measurement and application for machine component classification codes
• Internal Compression of Protocols to Entropy
• scientific article; zbMATH DE number 1761405 (Why is no real title available?)
• scientific article; zbMATH DE number 3552382 (Why is no real title available?)
• scientific article; zbMATH DE number 3700709 (Why is no real title available?)
• Heteromorph zone method of compression of Ukrainian texts
• A new model of numerical computer data and its application for construction of minimum-redundancy codes
• Space-Efficient Informational Redundancy
• On Joint Information Embedding and Lossy Compression
• Compression of partially defined information
• Classification of binary vectors by stochastic complexity.

This page was built for publication:

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