Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights
From MaRDI portal
Cites work
- A characteristic property of self-orthogonal codes and its application to lattices
- A coding theory construction of new systematic authentication codes
- A construction of binary linear codes from Boolean functions
- A Construction of Minimal Linear Codes From Partial Difference Sets
- A family of difference sets in non-cyclic groups
- A new upper bound on the minimal distance of self-dual codes
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Bent functions. Fundamentals and results
- Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction
- Binary Linear Codes With Few Weights From Two-to-One Functions
- Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances
- Boolean functions for cryptography and coding theory
- Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters
- Constructions of self-orthogonal linear codes and dual-containing BCH codes
- Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Linear codes from functions
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear codes from simplicial complexes
- Linear Codes From Some 2-Designs
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Minimal \(p\)-ary codes via the direct sum of functions, non-covering permutations and subspaces of derivatives
- Minimal Binary Linear Codes
- Minimal Binary Linear Codes From Vectorial Boolean Functions
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes arising from blocking sets
- Minimal Linear Codes From Characteristic Functions
- Minimal linear codes from Maiorana-McFarland functions
- Minimal vectors in linear codes
- Nonlinearities of S-boxes
- On ``bent functions
- Optimal Few-Weight Codes From Simplicial Complexes
- Orthogonal, antiorthogonal and self-orthogonal matrices and their codes
- Quantum Error Correction and Orthogonal Geometry
- Quantum error correction via codes over GF(4)
- Secret sharing schemes from three classes of linear codes
- Self-orthogonal codes over a non-unital ring and combinatorial matrices
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Several classes of minimal linear codes from vectorial Boolean functions and p-ary functions
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Several Families of Binary Minimal Linear Codes From Two-to-One Functions
- Several new classes of self-orthogonal minimal linear codes violating the Ashikhmin-Barg condition
- Some Punctured Codes of Several Families of Binary Linear Codes
- The Geometry of Two-Weight Codes
- Towards secure two-party computation from the wire-tap channel
- Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
This page was built for publication: Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345670)
