On the capacity of Markov sources over noisy channels

Conference Record / IEEE Global Telecommunications Conference

Volumn 5, Issue , 2001, Pages 2997-3001

  Kavčić, Aleksandar ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MARKOV PROCESSES; MONTE CARLO METHODS; OPTIMIZATION; PROBABILITY; SPURIOUS SIGNAL NOISE;

NOISY FINITE MACHINE CHANNELS;

CHANNEL CAPACITY;

EID: 0035687645     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A mathematical theory of communications
2. On runlength codes
3. Codes for digital recorders
4. Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs
5. The intersymbol interference channel: Lower bounds on capacity and channel precoding loss
6. On the information rate of binary-input channels with memory
7. On the achievable information rates of finite state ISI channels
8. An algorithm for computing the capacity of arbitrary discrete memoryless channels
9. Computation of channel capacity and rate-distortion functions
10. Coding for channels with cost constraints
11. Optimal decoding of linear codes for minimizing symbol error rate
12. An upper bound on the capacity of channels with memory and contraint input