Few-weight quaternary codes via simplicial complexes
From MaRDI portal
Publication:2133255
DOI10.3934/MATH.2021303zbMATH Open1484.94028OpenAlexW3138473808MaRDI QIDQ2133255FDOQ2133255
Recommendations
- Linear codes from simplicial complexes
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- New classes of binary few weight codes from trace codes over a chain ring
- Two classes of optimal \(p\)-ary few-weight codes from down-sets
- On codes over integers modulo \(q\)
Cites work
- A Bound for Error-Correcting Codes
- Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction
- Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
- Fundamentals of Error-Correcting Codes
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Linear Codes From Some 2-Designs
- Linear codes from simplicial complexes
- Minimal vectors in linear codes
- Optimal Few-Weight Codes From Simplicial Complexes
- Optimal minimal linear codes from posets
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
Cited in
(9)- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\)
- On codes over integers modulo \(q\)
- Linear codes from simplicial complexes over \(\mathbb{F}_{2^n}\)
- Linear codes from simplicial complexes
- Octanary linear codes using simplicial complexes
- Construction of binary self-orthogonal codes
- Optimal Additive Quaternary Codes of Low Dimension
- Subquadratic encodings for point configurations
This page was built for publication: Few-weight quaternary codes via simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133255)
