On Minimal and Quasi-minimal Linear Codes
From MaRDI portal
Publication:2870086
DOI10.1007/978-3-642-45239-0_6zbMath1317.94144OpenAlexW2220269422MaRDI QIDQ2870086
Sihem Mesnager, Alain Patey, Gérard D. Cohen
Publication date: 17 January 2014
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45239-0_6
Related Items (36)
An inductive construction of minimal codes ⋮ Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound ⋮ Secret sharing schemes based on the dual of Golay codes ⋮ Small Strong Blocking Sets by Concatenation ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ The fullrank value function ⋮ Three-weight minimal linear codes ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ Variations on Minimal Linear Codes ⋮ Minimal linear codes constructed from functions ⋮ On the weight distribution of some minimal codes ⋮ The parameters of minimal linear codes ⋮ Linear codes from simplicial complexes ⋮ New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications] ⋮ Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights ⋮ On the lower bound for the length of minimal codes ⋮ Minimal linear codes from Maiorana-McFarland functions ⋮ Minimal codewords arising from the incidence of points and hyperplanes in projective spaces ⋮ Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications ⋮ Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\) ⋮ Minimal linear codes from Hermitian varieties and quadrics ⋮ Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Optimal minimal linear codes from posets ⋮ Optimal non-projective linear codes constructed from down-sets ⋮ Characterization of some minimal codes for secret sharing ⋮ Construction of two- or three-weight binary linear codes from Vasil'ev codes ⋮ Linear codes with few weights from weakly regular plateaued functions ⋮ Linear codes with few weights from weakly regular bent functions based on a generic construction ⋮ Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents ⋮ A construction of \(p\)-ary linear codes with two or three weights ⋮ Construction of minimal linear codes from multi-variable functions ⋮ Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions ⋮ Minimal linear codes over finite fields ⋮ Hamming weight distributions of multi-twisted codes over finite fields ⋮ A geometric characterization of minimal codes and their asymptotic performance ⋮ Yet another variation on minimal linear codes
This page was built for publication: On Minimal and Quasi-minimal Linear Codes
