Abstract
It has been proved in Bierbrauer and Kyureghyan (Des. Codes Cryptogr. 46:269---301, 2008) that a binomial function aX i + bX j can be crooked only if both exponents i, j have 2-weight ?2. In the present paper we give a brief construction for all known examples of crooked binomial functions. These consist of an infinite family and one sporadic example. The construction of the sporadic example uses the properties of an algebraic curve of genus 3. Computer experiments support the conjecture that each crooked binomial is equivalent either to a member of the family or to the sporadic example.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
