Minimal codewords: an application of relative four-weight codes

DOI10.1142/S1793830923500623MaRDI QIDQ6637066zbMATH OpenFDO

Authors B. Rega, A. Ramesh Babu

Publication date 13 November 2024

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830923500623

zbMATH Keywords

minimal codewordsrelative four-weight codessecret sharing schemes

Mathematics Subject Classification ID

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

Recommendations

• Characterization of some minimal codes for secret sharing
• Secret Sharing Schemes from Two-Weight Codes
• Secret sharing schemes from three classes of linear codes
• scientific article; zbMATH DE number 1057740
• Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions

Cites work

• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• Constructions of intersecting codes
• Geometric approach to higher weights
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Linear intersecting codes
• Minimal vectors in linear codes
• On relative constant-weight codes
• Secret sharing schemes from binary linear codes
• Secret sharing schemes from three classes of linear codes
• The \(t\)-wise intersection and trellis of relative four-weight codes
• The weight hierarchies of q-ary codes of dimension 4
• Trellis complexity and pseudoredundancy of relative two-weight codes

This page was built for publication: Minimal codewords: an application of relative four-weight codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637066)