WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Designs, Codes and Cryptography
  2. Designs, Codes and Cryptography : Volume 46
  3. Designs, Codes and Cryptography : Volume 46, Issue 3, March 2008
  4. Crooked binomials
Loading...

Please wait, while we are loading the content...

Designs, Codes and Cryptography : Volume 84
Designs, Codes and Cryptography : Volume 83
Designs, Codes and Cryptography : Volume 82
Designs, Codes and Cryptography : Volume 81
Designs, Codes and Cryptography : Volume 80
Designs, Codes and Cryptography : Volume 79
Designs, Codes and Cryptography : Volume 78
Designs, Codes and Cryptography : Volume 77
Designs, Codes and Cryptography : Volume 76
Designs, Codes and Cryptography : Volume 75
Designs, Codes and Cryptography : Volume 74
Designs, Codes and Cryptography : Volume 73
Designs, Codes and Cryptography : Volume 72
Designs, Codes and Cryptography : Volume 71
Designs, Codes and Cryptography : Volume 70
Designs, Codes and Cryptography : Volume 69
Designs, Codes and Cryptography : Volume 68
Designs, Codes and Cryptography : Volume 67
Designs, Codes and Cryptography : Volume 66
Designs, Codes and Cryptography : Volume 65
Designs, Codes and Cryptography : Volume 64
Designs, Codes and Cryptography : Volume 63
Designs, Codes and Cryptography : Volume 62
Designs, Codes and Cryptography : Volume 61
Designs, Codes and Cryptography : Volume 60
Designs, Codes and Cryptography : Volume 59
Designs, Codes and Cryptography : Volume 58
Designs, Codes and Cryptography : Volume 57
Designs, Codes and Cryptography : Volume 56
Designs, Codes and Cryptography : Volume 55
Designs, Codes and Cryptography : Volume 54
Designs, Codes and Cryptography : Volume 53
Designs, Codes and Cryptography : Volume 52
Designs, Codes and Cryptography : Volume 51
Designs, Codes and Cryptography : Volume 50
Designs, Codes and Cryptography : Volume 49
Designs, Codes and Cryptography : Volume 48
Designs, Codes and Cryptography : Volume 47
Designs, Codes and Cryptography : Volume 46
Designs, Codes and Cryptography : Volume 46, Issue 3, March 2008
Maximal caps in AG (6, 3)
On the intersection of two subgeometries of PG(n, q)
Crooked binomials
Homogeneous factorisations of Johnson graphs
Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
Williamson matrices up to order 59
Cryptographic properties of nonlinear pseudorandom number generators
New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups
Designs, Codes and Cryptography : Volume 46, Issue 2, February 2008
Designs, Codes and Cryptography : Volume 46, Issue 1, January 2008
Designs, Codes and Cryptography : Volume 45
Designs, Codes and Cryptography : Volume 44
Designs, Codes and Cryptography : Volume 43
Designs, Codes and Cryptography : Volume 42
Designs, Codes and Cryptography : Volume 41
Designs, Codes and Cryptography : Volume 40
Designs, Codes and Cryptography : Volume 39
Designs, Codes and Cryptography : Volume 38
Designs, Codes and Cryptography : Volume 37
Designs, Codes and Cryptography : Volume 36
Designs, Codes and Cryptography : Volume 35
Designs, Codes and Cryptography : Volume 34
Designs, Codes and Cryptography : Volume 33
Designs, Codes and Cryptography : Volume 32
Designs, Codes and Cryptography : Volume 31
Designs, Codes and Cryptography : Volume 30
Designs, Codes and Cryptography : Volume 29
Designs, Codes and Cryptography : Volume 28
Designs, Codes and Cryptography : Volume 27
Designs, Codes and Cryptography : Volume 26
Designs, Codes and Cryptography : Volume 25
Designs, Codes and Cryptography : Volume 24
Designs, Codes and Cryptography : Volume 23
Designs, Codes and Cryptography : Volume 22
Designs, Codes and Cryptography : Volume 21
Designs, Codes and Cryptography : Volume 20
Designs, Codes and Cryptography : Volume 19
Designs, Codes and Cryptography : Volume 18
Designs, Codes and Cryptography : Volume 17
Designs, Codes and Cryptography : Volume 16
Designs, Codes and Cryptography : Volume 15
Designs, Codes and Cryptography : Volume 14
Designs, Codes and Cryptography : Volume 13
Designs, Codes and Cryptography : Volume 12
Designs, Codes and Cryptography : Volume 11
Designs, Codes and Cryptography : Volume 10

Similar Documents

...
A family of crooked functions

Article

...
Self-embeddings of Hamming Steiner triple systems of small order and APN permutations

Article

...
A matrix approach for constructing quadratic APN functions

Article

...
Intersection of Hamming codes avoiding Hamming subcodes

Article

...
On the classification of APN functions up to dimension five

Article

...
On the minimum distance graph of an extended Preparata code

Article

...
On the automorphism groups of the $$Z_2 Z_4$$ -linear 1-perfect and Preparata-like codes

Article

...
Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions

Article

...
On quadratic APN functions and dimensional dual hyperovals

Article

Crooked binomials

Content Provider Springer Nature Link
Author Bierbrauer, Jürgen Kyureghyan, Gohar M.
Copyright Year 2008
Abstract A function f : GF(2 r ) → GF(2 r ) is called crooked if the sets {f(x) + f(x + a)|x ∈ GF(2 r )} is an affine hyperplane for any nonzero a ∈ GF(2 r ). We prove that a crooked binomial function f(x) = x d  + ux e defined on GF(2 r ) satisfies that both exponents d, e have 2-weights at most 2.
Starting Page 269
Ending Page 301
Page Count 33
File Format PDF
ISSN 09251022
Journal Designs, Codes and Cryptography
Volume Number 46
Issue Number 3
e-ISSN 15737586
Language English
Publisher Springer US
Publisher Date 2008-01-12
Publisher Place Boston
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Crooked functions APN functions Codes Cyclotomic cosets Preparata codes Information and Communication, Circuits Discrete Mathematics in Computer Science Data Encryption Data Structures, Cryptology and Information Theory Coding and Information Theory Combinatorics
Content Type Text
Resource Type Article
Subject Applied Mathematics Discrete Mathematics and Combinatorics Theoretical Computer Science Computer Science Applications
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...