Several classes of optimal linear codes with few weights from simplicial complexes

DOI10.1016/J.FFA.2026.102845MaRDI QIDQ7268680zbMATH OpenFDO

Authors Zhao Hu, Nian Li, Xiangyong Zeng, Shizhu Tian, Yiheng Chen

Publication date 18 June 2026

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.FFA.2026.102845

zbMATH Keywords

few-weight codegriesmer boundoptimal linear codesimplicial complexweight distribution

Mathematics Subject Classification ID

Exponential sums (11T23) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites work

• A Bound for Error-Correcting Codes
• A class of three-weight linear codes over finite fields of odd characteristic
• A class of two or three weights linear codes and their complete weight enumerators
• A coding theory construction of new systematic authentication codes
• A construction of several classes of two-weight and three-weight linear codes
• A family of linear codes from constant dimension subspace codes
• A Generic Construction of Cartesian Authentication Codes
• A Subfield-Based Construction of Optimal Linear Codes Over Finite Fields
• Algebraically punctured cyclic codes
• Certain binary minimal codes constructed using simplicial complexes
• Codes for error detection.
• Codes over the non-unital non-commutative ring E using simplicial complexes
• Cyclotomic Linear Codes of Order 3
• Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u]\)-additive codes from down-sets
• Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
• Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
• Few-weight quaternary codes via simplicial complexes
• Fundamentals of Error-Correcting Codes
• Generalized Hamming Weights of Irreducible Cyclic Codes
• How to build robust shared control systems
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3871188 (Why is no real title available?)
• Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Linear codes from simplicial complexes
• Linear codes from simplicial complexes over \(\mathbb{F}_{2^n}\)
• Linear codes with two or three weights from quadratic bent functions
• Minimal Linear Codes From Characteristic Functions
• Minimal vectors in linear codes
• New classes of binary few weight codes from trace codes over a chain ring
• New constructions of optimal linear codes from simplicial complexes
• Octanary linear codes using simplicial complexes
• Optimal binary few-weight codes using a mixed alphabet ring and simplicial complexes
• Optimal Binary Linear Codes From Maximal Arcs
• Optimal Few-Weight Codes From Simplicial Complexes
• Optimal non-projective linear codes constructed from down-sets
• Projective Linear Codes From Some Almost Difference Sets
• Quaternary codes and their binary images
• Quaternary Linear Codes and Related Binary Subfield Codes
• Secret sharing schemes from three classes of linear codes
• Several classes of linear codes with few weights from the closed butterfly structure
• Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
• Strongly regular graphs
• Subfield codes of \(C_D\)-codes over \(\mathbb{F}_2 [x] / \langle x^3 - x \rangle\)
• The Geometry of Two-Weight Codes
• Two classes of optimal p-ary few-weight codes from down-sets
• Two infinite families of quaternary codes
• Two-weight and three-weight linear codes based on Weil sums

This page was built for publication: Several classes of optimal linear codes with few weights from simplicial complexes

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