635 research outputs found
Feedback Capacity of the Compound Channel
In this work we find the capacity of a compound finite-state channel with
time-invariant deterministic feedback. The model we consider involves the use
of fixed length block codes. Our achievability result includes a proof of the
existence of a universal decoder for the family of finite-state channels with
feedback. As a consequence of our capacity result, we show that feedback does
not increase the capacity of the compound Gilbert-Elliot channel. Additionally,
we show that for a stationary and uniformly ergodic Markovian channel, if the
compound channel capacity is zero without feedback then it is zero with
feedback. Finally, we use our result on the finite-state channel to show that
the feedback capacity of the memoryless compound channel is given by
.Comment: 34 pages, 2 figures, submitted to IEEE Transactions on Information
Theor
Guessing based on length functions
A guessing wiretapper's performance on a Shannon cipher system is analyzed
for a source with memory. Close relationships between guessing functions and
length functions are first established. Subsequently, asymptotically optimal
encryption and attack strategies are identified and their performances analyzed
for sources with memory. The performance metrics are exponents of guessing
moments and probability of large deviations. The metrics are then characterized
for unifilar sources. Universal asymptotically optimal encryption and attack
strategies are also identified for unifilar sources. Guessing in the increasing
order of Lempel-Ziv coding lengths is proposed for finite-state sources, and
shown to be asymptotically optimal. Finally, competitive optimality properties
of guessing in the increasing order of description lengths and Lempel-Ziv
coding lengths are demonstrated.Comment: 16 pages, Submitted to IEEE Transactions on Information Theory,
Special issue on Information Theoretic Security, Simplified proof of
Proposition
Towards a geometrical interpretation of quantum information compression
Let S be the von Neumann entropy of a finite ensemble E of pure quantum
states. We show that S may be naturally viewed as a function of a set of
geometrical volumes in Hilbert space defined by the states and that S is
monotonically increasing in each of these variables. Since S is the Schumacher
compression limit of E, this monotonicity property suggests a geometrical
interpretation of the quantum redundancy involved in the compression process.
It provides clarification of previous work in which it was shown that S may be
increased while increasing the overlap of each pair of states in the ensemble.
As a byproduct, our mathematical techniques also provide a new interpretation
of the subentropy of E.Comment: 11 pages, latex2
- …