Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A lor bound bound is established on the error probability of fixed-length block-coding systems with finite memory feedback, which can be described in terms of a time dependent finite state machine. It is shown that the reliability function of such coding systems over discrete memoryless channels is upper-bounded by the sphere-packing exponent.
['Giacomo Como', 'Baris Nakiboglu']
I am writing a research paper on a idea Sphere-packing bound for block-codes with feedback and finite memory
[{"from": "human", "value": "I am writing a research paper on a idea Sphere-packing bound for block-codes with feedback and finite memory"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A lor bound bound is established on the error probability of fixed-length block-coding systems with finite memory feedback, which can be described in terms of a time dependent finite state machine. It is shown that the reliability function of such coding systems over discrete memoryless channels is upper-bounded by the sphere-packing exponent."}]