Minimal vectors in linear codes

DOI10.1109/18.705584zbMath0932.94032OpenAlexW2163834165MaRDI QIDQ4701180

Alexander Barg, Alexei Ashikhmin

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.705584

zbMATH Keywords

Reed-Muller codeslinear codescodes over ringsdecoding algorithmssecret sharing schemesminimal vectorszero-neighbors

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Authentication, digital signatures and secret sharing (94A62)

Related Items

Boolean functions with six-valued Walsh spectra and their application ⋮ 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 ⋮ Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal gray image ⋮ Two classes of optimal \(p\)-ary few-weight codes from down-sets ⋮ Minimal linear codes from weakly regular bent functions ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ Few-weight quaternary codes via simplicial complexes ⋮ The fullrank value function ⋮ Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\) ⋮ 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 ⋮ Three-weight minimal linear codes ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ Variations on Minimal Linear Codes ⋮ On the ideal associated to a linear code ⋮ The geometric structure of relative one-weight codes ⋮ On the intersection of binary linear codes ⋮ Even poset and a parity result for binary linear code ⋮ Minimal linear codes constructed from functions ⋮ Few-weight codes from trace codes over a local ring ⋮ Unnamed Item ⋮ On the weight distribution of some minimal codes ⋮ Constructions of projective linear codes by the intersection and difference of sets ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ Five classes of optimal two-weight linear codes ⋮ The parameters of minimal linear codes ⋮ Linear codes from simplicial complexes ⋮ Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\) ⋮ A construction of \(q\)-ary linear codes with two weights ⋮ FEW-WEIGHT CODES FROM TRACE CODES OVER ⋮ Pure resolutions, linear codes, and Betti numbers ⋮ The maximum number of minimal codewords in an \([n,k\)-code] ⋮ 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] ⋮ Constructing few-weight linear codes and strongly regular graphs ⋮ 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\) ⋮ Complete weight enumerators of a class of linear codes with two weights ⋮ Secret sharing schemes from binary linear codes ⋮ Optimal codes from Fibonacci polynomials and secret sharing schemes ⋮ Minimal linear codes from Maiorana-McFarland functions ⋮ Ideal access structures based on a class of minimal linear codes ⋮ Minimal linear codes from Hermitian varieties and quadrics ⋮ On a kind of two-weight code ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ Weight distributions of Q2DC codes over finite fields ⋮ A note on the minimal binary linear code ⋮ A family of distance-optimal minimal linear codes with flexible parameters ⋮ Minimal supports in linear codes ⋮ Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Two new classes of projective two-weight linear codes ⋮ 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 ⋮ The \(t\)-wise intersection of relative two-weight codes ⋮ The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures ⋮ 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 ⋮ Projective binary linear codes from special Boolean functions ⋮ Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents ⋮ Several classes of linear codes with few weights from the closed butterfly structure ⋮ Optimal binary codes from trace codes over a non-chain ring ⋮ Complete weight enumerators of a family of three-weight linear codes ⋮ Linear codes from quadratic forms ⋮ Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\) ⋮ On the counting complexity of propositional circumscription ⋮ Minimal codewords in Reed-Muller codes ⋮ Secret sharing schemes based on graphical codes ⋮ Minimal linear codes arising from blocking sets ⋮ A construction of \(p\)-ary linear codes with two or three weights ⋮ Construction of minimal linear codes from multi-variable functions ⋮ On the De Boer-Pellikaan method for computing minimum distance ⋮ Wide minimal binary linear codes from the general Maiorana-Mcfarland class ⋮ 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 ⋮ Minimal linear codes over finite fields ⋮ Hamming weight distributions of multi-twisted codes over finite fields ⋮ A family of projective two-weight linear codes ⋮ On the non-minimal codewords in binary Reed-Muller codes ⋮ Implementing gradient descent decoding ⋮ On the number of minimal codewords in codes generated by the adjacency matrix of a graph ⋮ A family of linear codes from constant dimension subspace codes ⋮ Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes ⋮ Secret Sharing Schemes from Linear Codes overFp + vFp ⋮ A geometric characterization of minimal codes and their asymptotic performance ⋮ New classes of \(p\)-ary few weight codes ⋮ The separation of binary relative three-weight codes and its applications ⋮ MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\) ⋮ Computing sharp recovery structures for locally recoverable codes ⋮ Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u\)-additive codes from down-sets] ⋮ On relative constant-weight codes ⋮ The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes] ⋮ Extensions of the critical theorem ⋮ Yet another variation on minimal linear codes ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes ⋮ Small Strong Blocking Sets by Concatenation ⋮ Generalization of the Ball-Collision Algorithm ⋮ Constructions of linear codes with two or three weights from vectorial dual-bent functions ⋮ Two families of few-weight codes over a finite chain ring ⋮ 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 ⋮ Two classes of few-Lee weight \(\mathbb{Z}_2 [u\)-linear codes using simplicial complexes and minimal codes via Gray map] ⋮ The subfield and extended codes of a subclass of optimal three-weight cyclic codes ⋮ On the lower bound for the length of minimal codes ⋮ Octanary linear codes using simplicial complexes ⋮ On the subfield codes of a subclass of optimal cyclic codes and their covering structures ⋮ Optimal binary linear codes from posets of the disjoint union of two chains ⋮ Minimal codewords arising from the incidence of points and hyperplanes in projective spaces ⋮ On the minimum number of minimal codewords ⋮ Generalized weights of codes over rings and invariants of monomial ideals ⋮ Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications ⋮ Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\) ⋮ Five-weight codes from three-valued correlation of M-sequences ⋮ Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\) ⋮ Some codes over \(\mathcal{R} = \mathcal{R}_1\mathcal{R}_2\mathcal{R}_3\) and their applications in secret sharing schemes ⋮ Triple Cyclic Codes Over 𝔽q + u𝔽q