An inductive construction of minimal codes

DOI10.1007/s12095-021-00474-2zbMath1496.94080arXiv1911.09093OpenAlexW3134278399MaRDI QIDQ2119851

Daniele Bartoli, Matteo Bonini, Burçin Güneş

Publication date: 30 March 2022

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.09093

zbMATH Keywords

linear codesminimal codessecret sharing schemes

Mathematics Subject Classification ID

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

Related Items (4)

Three Combinatorial Perspectives on Minimal Codes ⋮ Some hypersurfaces over finite fields, minimal codes and secret sharing schemes ⋮ Minimal codewords in norm-trace codes ⋮ A geometric characterization of minimal codes and their asymptotic performance

Cites Work

• Unnamed Item
• Unnamed Item
• Three-weight cyclic codes and their weight distributions
• Linear codes from simplicial complexes
• Minimal linear codes over finite fields
• Minimal linear codes arising from blocking sets
• On Minimal and Quasi-minimal Linear Codes
• Linear Codes From Some 2-Designs
• How to share a secret
• Towards Secure Two-Party Computation from the Wire-Tap Channel
• The hardness of decoding linear codes with preprocessing
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Secret sharing schemes from three classes of linear codes
• On the inherent intractability of certain coding problems (Corresp.)
• Minimal Binary Linear Codes
• Minimal vectors in linear codes
• Minimal Linear Codes in Odd Characteristic

This page was built for publication: An inductive construction of minimal codes