Linear codes from simplicial complexes over F₂^n
From MaRDI portal
Publication:6618623
Recommendations
- Linear codes from simplicial complexes
- Octanary linear codes using simplicial complexes
- Certain binary minimal codes constructed using simplicial complexes
- 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
Cites work
- A Bound for Error-Correcting Codes
- Few-weight quaternary codes via simplicial complexes
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3894973 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Linear codes from simplicial complexes
- Minimal vectors in linear codes
- New constructions of optimal linear codes from simplicial complexes
- Octanary linear codes using simplicial complexes
- Optimal minimal linear codes from posets
- Quaternary Linear Codes and Related Binary Subfield Codes
- The Subfield Codes and Subfield Subcodes of a Family of MDS Codes
- The Subfield Codes of Ovoid Codes
Cited in
(6)- Octanary linear codes using simplicial complexes
- Certain binary minimal codes constructed using simplicial complexes
- Subfield codes of \(C_D\)-codes over \(\mathbb{F}_2 [x] / \langle x^3 - x \rangle\)
- Binary subfield codes of codes over a certain chain ring
- Several classes of optimal linear codes with few weights from simplicial complexes
- Hamming weight enumerators and hulls of linear codes with new parameters associated with simplicial complexes
This page was built for publication: Linear codes from simplicial complexes over \(\mathbb{F}_{2^n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618623)
