IEEE Transactions on Information Theory · 1974 · 100 citations · 6 references
EngineeringComputer ScienceElectrical EngineeringAlgorithmsDigital CommunicationInformation TheoryChannel CodingCoding TheoryError Control CodingError-correcting CodesRate-distortion TheorySource CodingCode RateDistortion MeasuresFixed-length CodingRate-distortion BoundsRate-distortion CodingRate-distortion FunctionRate-distortion TradeoffSource Coding With Fidelity Criteria
For memoryless discrete-time sources and bounded single-letter distortion measures, we derive a bound on the average per-letter distortion achievable by a trellis source code of fixed constraint length. For any fixed code rate greater than <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R(D^{\ast})</tex> , the rate-distortion function at <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D^{\ast}</tex> , this bound decreases toward <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D^{\ast}</tex> exponentially with constraint length.
6