scientific article; zbMATH DE number 2040937
From MaRDI portal
Publication:4452086
zbMath1038.94008MaRDI QIDQ4452086
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2731/27310011.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An inductive construction of minimal codes, Secret sharing schemes based on the dual of Golay codes, Minimal linear codes from weakly regular bent functions, Minimal binary linear codes: a general framework based on bent concatenation, New classes of binary few weight codes from trace codes over a chain ring, Two-weight and three-weight linear codes constructed from Weil sums, Variations on Minimal Linear Codes, Minimal linear codes constructed from functions, Few-weight codes from trace codes over a local ring, Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\), Five classes of optimal two-weight linear codes, Linear codes from simplicial complexes, FEW-WEIGHT CODES FROM TRACE CODES OVER, Some hypersurfaces over finite fields, minimal codes and secret sharing schemes, A construction of \(q\)-ary linear codes with irreducible cyclic codes, 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], Two families of few-weight codes over a finite chain ring, Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\), Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights, Construction of minimal linear codes with few weights from weakly regular plateaued functions, Secret sharing schemes from binary linear codes, Optimal codes from Fibonacci polynomials and secret sharing schemes, Minimal linear codes from Maiorana-McFarland functions, On the minimum number of minimal codewords, Ideal access structures based on a class of minimal linear codes, Five-weight codes from three-valued correlation of M-sequences, Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\), Weight distributions of Q2DC codes over finite fields, A family of distance-optimal minimal linear codes with flexible parameters, The optimal linear secret sharing scheme for any given access structure, Optimal minimal linear codes from posets, Optimal non-projective linear codes constructed from down-sets, Minimal linear codes from weakly regular plateaued balanced functions, Linear codes from weakly regular plateaued functions and their secret sharing schemes, Construction of two- or three-weight binary linear codes from Vasil'ev codes, Optimal binary codes from trace codes over a non-chain ring, A new secret sharing scheme, Weight enumerators of a class of linear codes, Secret sharing schemes for compartmented access structures, Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\), Secret sharing schemes based on graphical codes, 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, A family of projective two-weight linear codes, A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme, A novel secret sharing scheme based on minimal linear codes, A family of linear codes from constant dimension subspace codes, New classes of \(p\)-ary few weight codes, MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\), Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\), Yet another variation on minimal linear codes
