2000 character limit reached
Binary Cyclic codes with two primitive nonzeros
Published 21 Jan 2013 in cs.IT, math.CO, and math.IT | (1301.4773v1)
Abstract: In this paper, we make some progress towards a well-known conjecture on the minimum weights of binary cyclic codes with two primitive nonzeros. We also determine the Walsh spectrum of $\Tr(xd)$ over $\F_{2{m}}$ in the case where $m=2t$, $d=3+2{t+1}$ and $\gcd(d, 2{m}-1)=1$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
