Minimal linear codes constructed from partial spreads

DOI10.1007/s12095-023-00689-5zbMATH Open1547.94505MaRDI QIDQ6571309

Wei Lu, Gaojun Luo, Xiwang Cao, Xia Wu

Publication date: 11 July 2024

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

zbMATH Keywords

linear codepartial spreadminimal code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Finite partial geometries (general), nets, partial spreads (51E14)

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal symplectic partial spreads
• Minimal linear codes over finite fields
• Minimal linear codes arising from blocking sets
• A family of linear codes from constant dimension subspace codes
• A geometric characterization of minimal codes and their asymptotic performance
• An inductive construction of minimal codes
• Bent partitions
• On cutting blocking sets and their codes
• Minimal linear codes from Maiorana-McFarland functions
• The dimension and minimum distance of two classes of primitive BCH codes
• The parameters of minimal linear codes
• On Minimal and Quasi-minimal Linear Codes
• 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
• Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
• A Construction of Minimal Linear Codes From Partial Difference Sets
• Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
• Three Combinatorial Perspectives on Minimal Codes
• Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
• Minimal Linear Codes in Odd Characteristic

This page was built for publication: Minimal linear codes constructed from partial spreads