Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let t(n,k) denote the minimum covering radius of a binary linear (n,k) code.  give a nonconstructive upper bound on t(n,k) , which coincides asymptotically with the known lor bound, namely n^{-1}t(n,nR)=H^{-1}(1-R)+O(n^{-l}\log n) , where R is fixed, 0 , and H^{-1} is the inverse of the binary entropy function.
['Gérard D. Cohen']
I am writing a research paper on a idea A nonconstructive upper bound on covering radius
[{"from": "human", "value": "I am writing a research paper on a idea A nonconstructive upper bound on covering radius"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let t(n,k) denote the minimum covering radius of a binary linear (n,k) code.  give a nonconstructive upper bound on t(n,k) , which coincides asymptotically with the known lor bound, namely n^{-1}t(n,nR)=H^{-1}(1-R)+O(n^{-l}\\log n) , where R is fixed, 0 , and H^{-1} is the inverse of the binary entropy function."}]