Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  explore some links beten higher ights of binary codes based on entropy/length profiles and the asymptotic rate of (2,1)-separating codes. These codes find applications in digital fingerprinting and broadcast encryption for example.  conjecture some bounds on the higher ights, whose proof would considerably strengthen the upper bound on the rate of (2,1)-separating codes.
['Hans Georg Schaathun', 'Gérard D. Cohen']
I am writing a research paper on a idea A trellis-based bound on (2,1)-separating codes
[{"from": "human", "value": "I am writing a research paper on a idea A trellis-based bound on (2,1)-separating codes"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  explore some links beten higher ights of binary codes based on entropy/length profiles and the asymptotic rate of (2,1)-separating codes. These codes find applications in digital fingerprinting and broadcast encryption for example.  conjecture some bounds on the higher ights, whose proof would considerably strengthen the upper bound on the rate of (2,1)-separating codes."}]