• DocumentCode
    1047971
  • Title

    Two Characterizations of Crooked Functions

  • Author

    Godsil, Chris ; Roy, Aidan

  • Author_Institution
    Calgary Univ., Calgary
  • Volume
    54
  • Issue
    2
  • fYear
    2008
  • Firstpage
    864
  • Lastpage
    866
  • Abstract
    In this correspondence, we 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.
  • Keywords
    cryptography; error correction codes; graph theory; nonlinear functions; Preparata-like code minimum distance; crooked graph distance-regularity; crooked nonlinear function characterization; cryptography theory; error correcting code; Binary codes; Combinatorial mathematics; Cryptography; Galois fields; Information science; Kernel; Nonlinear equations; Parity check codes; Vectors; Almost perfect; Preparata code; crooked; distance-regular graph; error-correcting code; nonlinear function;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2007.913505
  • Filename
    4439848