Metric bounds on losses in adaptive coding
type: Item
instance of: scholarly article
title: Metric bounds on losses in adaptive coding
zbMATH Open document ID: 0622.94013
DOI: 10.1016/0020-0255(87)90024-7
author: J. David Flick
author: Peter Salamon
author: Bjarne Andresen
published in: Information Sciences
publication date: 1987-01-01T00:00:00Z
review text: A noiseless-channel coding system in which the source probabilities change continuously in time is introduced. Using a geometry defined by the second derivative matrix of the information-theoretic entropy function, a bound on the number of excess channel symbols (the redundancy) sent by a retrospective encoder during a fixed time interval is derived. Results on minimal-cost coding and their implications for a real-time coding algorithm are then explored. Underlying most of the discussion here is the assumption made on the separability of the time scales corresponding to the (high) character rate as compared with the rate of change of the source probabilities.
Mathematics Subject Classification ID: 94A24
zbMATH DE Number: 4010385
zbMATH Keywords: noiseless-channel coding system
zbMATH Keywords: bound on the number of excess channel symbols
zbMATH Keywords: redundancy
zbMATH Keywords: minimal-cost coding
zbMATH Keywords: real-time coding algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0255(87)90024-7
OpenAlex ID: W2030632423
cites work: Q5516510
cites work: The relation between information theory and the differential geometry approach to statistics
cites work: Q5529067
cites work: A geometric view of welfare gains with non-instantaneous adjustment
description: scientific article; zbMATH DE number 4010385