Two characterizations of crooked functions

Simple item page
dc.creatorRoy, Aidan
dc.creatorGodsil, Chris
dc.date2007-04-10
dc.date.accessioned2026-07-07T07:55:58Z
dc.date.available2026-07-07T07:55:58Z
dc.descriptionWe give two characterizations of crooked functions: one based on the minimum distance of a Preparata-like code, and the other based on the distance-regularity of a crooked graph.
dc.description6 pages, no figures
dc.identifierhttps://arxiv.org/abs/0704.1293
dc.identifierhttp://arxiv.org/abs/0704.1293
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127145
dc.subjectCombinatorics
dc.subject05E30; 94B05
dc.titleTwo characterizations of crooked functions
dc.typetext

Files

Collections

arXiv