Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case (Q2705978)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case |
scientific article |
Statements
19 March 2001
0 references
change detection
0 references
sequential coding
0 references
transition path
0 references
lower bound
0 references
redundancy
0 references
lossless universal coding
0 references
regular memoryless sources
0 references
upper bounds
0 references
0.95557594
0 references
0.8878965
0 references
0.8828755
0 references
0.8804449
0 references
0.88009405
0 references
0.86939406
0 references
0.86700475
0 references
0.8653257
0 references
Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case (English)
0 references
