New constructions of optimal linear codes from simplicial complexes
From MaRDI portal
(Redirected from Publication:6576094)
New constructions of optimal linear codes from simplicial complexes (scientific article; zbMATH DE number 7884529)
New constructions of optimal linear codes from simplicial complexes (scientific article; zbMATH DE number 7884529)
Cited in
(15)- Linear codes from simplicial complexes over \(\mathbb{F}_{2^n}\)
- The weight hierarchies of linear codes from simplicial complexes
- Four classes of wide minimal q-ary linear codes from a general method
- Construction of several infinite families of linear codes with new parameters: Hamming weight enumerators and hull dimensions
- The weight distributions and weight hierarchies of two classes of few-weight linear codes
- A new family of minimal linear codes from simplicial complexes
- A family of optimal dual-containing and reversible linear codes over \(\mathbb{F}_4\)
- Recursive construction of projective two-weight linear codes
- Four families of q-ary self-orthogonal codes via the defining-set construction
- Homogenization of binary linear codes and their applications
- Infinite families of linear codes over finite fields with new parameters and their hull dimensions
- Ramanujan graphs from simplicial complexes with few blockers
- 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
- Linear codes from multivariate functions associated with simplicial complexes
This page was built for publication: New constructions of optimal linear codes from simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576094)