The textbook "Joint Source Channel Coding Using Arithmetic Codes" offers a comprehensive analysis and innovative approaches to coding information using arithmetic codes. It highlights the relationship between arithmetic codes and tree codes and presents new perspectives on the decoding of arithmetic codes with forbidden symbols. The authors, Michael Hoffman and Khalid Sayood, introduce a method that allows arithmetic encoders to be modeled as finite state machines, facilitating the application of techniques for decoding convolutional codes, such as the list Viterbi decoding algorithm. Additionally, the possibility of coding Markov sources without considering the conditional probabilities is discussed, and a context-based arithmetic coding method is presented that utilizes the conditional probabilities of the Markov source. These approaches provide a systematic foundation for understanding and applying arithmetic codes with forbidden symbols.