Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources .I. The regular case (Q2705978): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:02, 3 February 2024
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
Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources .I. The regular case (English)
0 references
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
