Binary codes from the complements of the triangular graphs
From MaRDI portal
Recommendations
- Permutation decoding for the binary codes from triangular graphs.
- Codes associated with triangular graphs and permutation decoding
- Codes and designs from triangular graphs and their line graphs
- A note on the binary codes from triangular graphs
- Binary codes from graphs on triples and permutation decoding
Cited in
(10)- Optimal antiblocking systems of information sets for the binary codes related to triangular graphs
- Binary codes from reflexive uniform subset graphs on 3-sets
- Codes from embeddings of the strong product of triangular graphs and K₂ and certain induced subgraphs.
- scientific article; zbMATH DE number 5951771 (Why is no real title available?)
- A note on the binary codes from triangular graphs
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs.
- Isodual and self-dual codes from graphs
- Codes and designs from triangular graphs and their line graphs
- On the dual binary codes of the triangular graphs
This page was built for publication: Binary codes from the complements of the triangular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862720)