Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this correspondence,  prove that the class of binary self-dual doubly even 2-quasi-cyclic transitive codes is asymptotically good. This improves a recent result of Bazzi and Mitter ( IEEE Trans. Inf. Theory , vol. 52, pp. 3210-3219, 2006). The proof is based on the study of a particular class of codes invariant under dihedral groups using a blend of representation theory and probabilistic arguments. The methods are closely related to those used in Bazzi and Mitter. In order to complete the proof a number theoretical result of Hasse is needed.
['Conchita Martínez-Pérez', 'Wolfgang Willems']
I am writing a research paper on a idea Self-Dual Doubly Even $2$ -Quasi-Cyclic Transitive Codes Are Asymptotically Good
[{"from": "human", "value": "I am writing a research paper on a idea Self-Dual Doubly Even $2$ -Quasi-Cyclic Transitive Codes Are Asymptotically Good"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this correspondence,  prove that the class of binary self-dual doubly even 2-quasi-cyclic transitive codes is asymptotically good. This improves a recent result of Bazzi and Mitter ( IEEE Trans. Inf. Theory , vol. 52, pp. 3210-3219, 2006). The proof is based on the study of a particular class of codes invariant under dihedral groups using a blend of representation theory and probabilistic arguments. The methods are closely related to those used in Bazzi and Mitter. In order to complete the proof a number theoretical result of Hasse is needed."}]