2000 character limit reached
Two-weight codes and second order recurrences
Published 14 Sep 2017 in cs.IT and math.IT | (1709.04585v2)
Abstract: Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and give a condition on the roots of their check polynomials for them to be MDS.
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.