Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For memoryless discrete-time sources and bounded single-letter distortion measures,  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 R(D^{\ast}) , the rate-distortion function at D^{\ast} , this bound decreases toward D^{\ast} exponentially with constraint length.
['Andrew J. Viterbi', 'Jim K. Omura']
I am writing a research paper on a idea Trellis Encoding of memoryless discrete-time sources with a fidelity criterion
[{"from": "human", "value": "I am writing a research paper on a idea Trellis Encoding of memoryless discrete-time sources with a fidelity criterion"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For memoryless discrete-time sources and bounded single-letter distortion measures,  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 R(D^{\\ast}) , the rate-distortion function at D^{\\ast} , this bound decreases toward D^{\\ast} exponentially with constraint length."}]