Octanary linear codes using simplicial complexes

DOI10.1007/s12095-022-00617-zzbMath1529.94049OpenAlexW4312106628MaRDI QIDQ6107456

Ritumoni Sarma, Vidya Sagar

Publication date: 3 July 2023

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

Full work available at URL: https://doi.org/10.1007/s12095-022-00617-z

zbMATH Keywords

simplicial complexGriesmer codeminimal codesubfield codeoctanary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Other types of codes (94B60) Combinatorial aspects of simplicial complexes (05E45)

Related Items

Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\)

Cites Work

• Unnamed Item
• Unnamed Item
• Recent progress on weight distributions of cyclic codes over finite fields
• Linear codes from simplicial complexes
• Optimal non-projective linear codes constructed from down-sets
• Few-weight quaternary codes via simplicial complexes
• Optimal minimal linear codes from posets
• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• How to share a secret
• Towards Secure Two-Party Computation from the Wire-Tap Channel
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Secret sharing schemes from three classes of linear codes
• Fundamentals of Error-Correcting Codes
• Minimal vectors in linear codes
• Quaternary Linear Codes and Related Binary Subfield Codes
• Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
• The Subfield Codes of Ovoid Codes
• A Bound for Error-Correcting Codes