Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lor and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) construction
['Irina E. Bocharova', 'Rolf Johannesson', 'Boris D. Kudryashov']
I am writing a research paper on a idea Trellis Complexity of Short Linear Codes
[{"from": "human", "value": "I am writing a research paper on a idea Trellis Complexity of Short Linear Codes"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lor and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) construction"}]