A note on the binary codes from triangular graphs
From MaRDI portal
Recommendations
- On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs.
- Codes from embeddings of the strong product of triangular graphs and K₂ and certain induced subgraphs.
- On the dual binary codes of the triangular graphs
- Binary codes from the complements of the triangular graphs
- On the stabilizers of the minimum-weight codewords of some binary codes from graphs on triples
Cited in
(7)- Ternary codes from graphs on triples
- Binary codes from reflexive uniform subset graphs on 3-sets
- Binary codes from the complements of the triangular graphs
- scientific article; zbMATH DE number 5951771 (Why is no real title available?)
- On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs.
- On the stabilizers of the minimum-weight codewords of some binary codes from graphs on triples
- On the dual binary codes of the triangular graphs
This page was built for publication: A note on the binary codes from triangular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534269)
