arXiv (All)
open access
Further Results on Sum-Freedom of Binary and $q$-ary Functions
The notion of sum-freedom of binary functions was introduced recently by C. Carlet as a generalization of the APN functions used in cryptography; the $q$-ary version of the notion is a natural extension. For each integer $k$ with $0\le k\le n$, there is a $k$th order sum-free function on $\Bbb F_{2^
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Asymptotically Optimal List Size of Random Linear Codes#821054
- Need for Coherent Access in Constructing Quantum Cryptography#1154562
- Need for Coherent Access in Constructing Quantum Cryptography#1136750
- The 1/2-Conjecture for $q$-Binomial Coefficients with Fractional Index#1110255
- Powerful Primitives in the Bounded Quantum Storage Model#1049560
Record · ID 1106188
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive