DOI10.1007/978-3-319-12160-4_3zbMath1445.68087arXiv1306.6265OpenAlexW1805528006MaRDI QIDQ3193252
Alain Patey, Hervé Chabanne, Gérard D. Cohen
Publication date: 16 October 2015
Published in: Information Security and Cryptology -- ICISC 2013 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.6265
An inductive construction of minimal codes,
Small Strong Blocking Sets by Concatenation,
Minimal linear codes from weakly regular bent functions,
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,
Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\),
Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights,
Minimal linear codes from Maiorana-McFarland functions,
Octanary linear codes using simplicial complexes,
Minimal codewords arising from the incidence of points and hyperplanes in projective spaces,
On the minimum number of minimal codewords,
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\),
Optimal minimal linear codes from posets,
Minimal linear codes arising from blocking sets,
On the maximum number of minimal codewords,
Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions,
On the number of minimal codewords in codes generated by the adjacency matrix of a graph,
A geometric characterization of minimal codes and their asymptotic performance,
Yet another variation on minimal linear codes
