Joint source channel coding using arithmetic codes

• Main Author: Bi, Dongsheng.
• Other Authors: Hoffman, Michael W., Sayood, Khalid.
• Format: Electronic
• Language: English
• Published: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool Publishers, c2010.
• Series: Synthesis lectures on communications (Online), # 4.
• Subjects: Coding theory.; Error-correcting codes (Information theory)
• Online Access: Abstract with links to full text
• Item Description: Part of: Synthesis digital library of engineering and computer science.; Title from PDF t.p. (viewed on December 9, 2009).; Series from website.
• Physical Description: 1 electronic text (viii, 69 p. : ill.) : digital file.; Also available in print.
• Format: Mode of access: World Wide Web.; System requirements: Adobe Acrobat reader.
• Bibliography: Includes bibliographical references (p. 61-69).
• ISBN: 9781608451494 (electronic bk.)
• ISSN: 1932-1708
• Access: Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden symbols. If a limit is imposed on the maximum value of a key parameter in the encoder, this modified arithmetic encoder can also be modeled as a finite state machine and the code generated can be treated as a variable-length trellis code.The number of states used can be reduced and techniques used for decoding convolutional codes, such as the list Viterbi decoding algorithm, can be applied directly on the trellis.