Joint source-channel decoding of entropy coded Markov sources over binary symmetric channels

IEEE International Conference on Communications

Volumn 1, Issue , 1999, Pages 446-450

  Subbalakshmi, K P ^a   Vaisey, Jacques ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CODING; ENTROPY; SIGNAL TO NOISE RATIO; TURBO CODES;

BINARY SYMMETRIC CHANNEL; EXPECTED DELAY; JOINT SOURCE CHANNEL; JOINT SOURCE CHANNEL DECODING; MARKOV SOURCES; MAXIMUM A POSTERIORI; NOISY CHANNEL; VARIABLE LENGTH;

DECODING;

EID: 0008139071     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (6)

1. C. E. Shannon, "A mathematical theory of communication," Bell Systems Technical Journal, vol. 27, pp. 379-423 and 623-656, 1948.
2. K. Sayood and J. C. Borkenhagen, "Use of residual redundancy in the design of joint source channel coders," IEEE Transactions on Communications, vol. 39, pp. 839-846, June 1991.
3. N. Phamdo and N. Farvardin, "Optimal detection of discrete Markov sources over discrete memoryless channels," IEEE Transactions on Information Theory, vol. 40, pp. 186-193, January 1994.
4. K. P. Subbalakshmi and J. Vaisey, "Optimal decoding of memoryless sources over binary symmetric channels," in IEEE Data Compression Conference, p. 573, 1998.
5. N. Demir and K. Sayood, "Joint source/channel coding for variable length codes," in IEEE Data Compression Conference, pp. 139-148, 1998.
6. M. Park and D. J. Miller, "Decoding entropy-coded symbols over noisy channels by MAP sequence estimation for asynchronous HMMs," Conference on Information Science and Systems, 1998.