Minimal Binary Linear Codes
From MaRDI portal
Cited in
(56)- Rigid linear binary codes
- Complete weight enumerators of few-weight linear codes
- One type of finitely generated minimal linear code over the ring \(Z_{2n}\)
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Influences of some families of error-correcting codes
- Several classes of minimal linear codes from weakly regular and non-weakly regular bent functions
- Several new classes of p-ary weakly regular plateaued functions and minimal codes with several weights
- Secret sharing schemes based on the dual of Golay codes
- A note on the minimal binary linear code
- Minimal linear codes from weakly regular bent functions
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- Minimal linear codes constructed from partial spreads
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Minimal linear codes derived from weakly regular bent and plateaued functions
- Construction of minimal binary linear codes with dimension n+3
- A family of linear codes from constant dimension subspace codes
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
- Minimal linear codes from Maiorana-McFarland functions
- Several classes of minimal linear codes from vectorial Boolean functions and p-ary functions
- Optimal minimal linear codes from posets
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- Minimal binary linear codes: a general framework based on bent concatenation
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
- Minimal linear codes constructed from functions
- Homogenization of binary linear codes and their applications
- Minimal linear codes arising from blocking sets
- Construction of minimal linear codes from multi-variable functions
- Minimal linear codes over finite fields
- Construction of two- or three-weight binary linear codes from Vasil'ev codes
- Dual and Hull code in the first two generic constructions and relationship with the Walsh transform of cryptographic functions
- Minimum breakdown degradation in binary source encoding
- Three-weight minimal linear codes
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Four classes of wide minimal q-ary linear codes from a general method
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- Hamming weight distributions of multi-twisted codes over finite fields
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
- The parameters of minimal linear codes
- Minimal codes derived from plateaued functions over \(\mathbb{F}_5\)
- A family of optimal dual-containing and reversible linear codes over \(\mathbb{F}_4\)
- Minimal binary 2-neighbour-transitive codes
- Minimal linear codes from vectorial functions
- Minimal linear codes constructed from hierarchical posets with two levels
- Weight distributions and weight hierarchies of a class of binary linear codes with a few weights
- An inductive construction of minimal codes
- A family of distance-optimal minimal linear codes with flexible parameters
- The separation of binary relative three-weight codes and its applications
- Complete weight enumerators of quasi-2-dimensional cyclic codes
- Optimal binary linear codes from posets of the disjoint union of two chains
- Further designs for self-orthogonal and LCD codes developed from functions over finite fields
- Two new families of linear codes with five Lee-weights over \(\mathbb{F}_q + u \mathbb{F}_q\) and their Gray images
- Several classes of wide minimal binary linear codes based on general Maiorana-McFarland class
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- On the weight distribution of some minimal codes
- Infinite families of minimal binary codes via Krawtchouk polynomials
This page was built for publication: Minimal Binary Linear Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682934)
