scientific article; zbMATH DE number 3463524

zbMATH Open0295.94042MaRDI QIDQ4048958FDOQ4048958

Authors: B. M. Fitingof 

Publication date: 1967

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (41)

• Data compression using an ``imaginary sliding window
• Unconditional bases and bit-level compression
• An informational approach to the problem of compressing random processes
• About one formal schemes of information compression
• Title not available (Why is that?)
• Polynomial representation of binary trees of entropy binary codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Compression of quantum information
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression
• A theory of incremental compression
• Title not available (Why is that?)
• Epsilon Entropy and Data Compression
• Bernstein polynomials and learning theory
• ?-Entropy data compression
• Title not available (Why is that?)
• Optimal random coding
• Minimax optimal universal codeword sets
• Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World
• Data Compression for a Source with Markov Characteristics
• Title not available (Why is that?)
• Data compression by means of a ``book stack
• Title not available (Why is that?)
• Statistical mechanics of the data compression theorem
• Information compression and Varshamov-Gilbert bound
• Quantitative information measurement and application for machine component classification codes
• Internal Compression of Protocols to Entropy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)