Pages that link to "Item:Q1925351"
From MaRDI portal
The following pages link to Multi-alphabet universal coding of memoryless sources (Q1925351):
Displaying 14 items.
- Universal coding for discrete memoryless sources uniform with respect to output (Q809982) (← links)
- Twice-universal coding (Q1059045) (← links)
- Universal sequential coding of single messages (Q1112787) (← links)
- Data compression by means of a ``book stack'' (Q1155580) (← links)
- Multialphabet weighted universal coding of context tree sources (Q1386627) (← links)
- Efficient method of adaptive arithmetic coding for sources with large alphabets (Q1569285) (← links)
- Aim functions and sequential estimation of the source model for universal coding (Q1582958) (← links)
- A lower bound on compression of unknown alphabets (Q1770393) (← links)
- Joint matrix universal coding of sequences of independent symbols (Q1812353) (← links)
- Universal coding algorithm for a family of context Markov sources (Q2263012) (← links)
- Adaptive compression against a countable alphabet (Q2920856) (← links)
- Universal multiresolution source codes (Q4544659) (← links)
- Large Alphabet Source Coding Using Independent Component Analysis (Q4566507) (← links)
- (Q5263820) (← links)