Investigation of the permutation and linear codes from the Welch APN function
From MaRDI portal
Cites work
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A coding theory construction of new systematic authentication codes
- A construction of binary linear codes from Boolean functions
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- Algebraic coding theory
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Boolean functions and their applications in cryptography
- Boolean functions for cryptography and coding theory
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Complementary Sets, Generalized Reed–Muller Codes, and Power Control for OFDM
- Construction and Analysis of Cryptographic Functions
- Covering radius---Survey and recent results
- Cyclotomic Linear Codes of Order 3
- Determining the Nonlinearity of a New Family of APN Functions
- Differential cryptanalysis of DES-like cryptosystems
- Differential Properties of ${x\mapsto x^{2^{t}-1}}$
- Differential properties of power functions
- Divisibility properties for covering radius of certain cyclic codes
- Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284434 (Why is no real title available?)
- scientific article; zbMATH DE number 1088929 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear Codes From Some 2-Designs
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Linear codes with two or three weights from quadratic bent functions
- Note on cubics over GF(2ⁿ) and GF(3ⁿ)
- On cosets of the generalized first-order reed-muller code with low PMEPR
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On the decoding of binary cyclic codes with the Newton identities
- On the inherent intractability of certain coding problems (Corresp.)
- On the Shape of the General Error Locator Polynomial for Cyclic Codes
- On the solution of algebraic equations over finite fields
- On Two-to-One Mappings Over Finite Fields
- Recent results and problems on constructions of linear codes from cryptographic functions
- Sparse permutations with low differential uniformity
- The coset distribution of triple-error-correcting binary primitive BCH codes
- Three-weight cyclic codes and their weight distributions
This page was built for publication: Investigation of the permutation and linear codes from the Welch APN function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994733)
