Codes and designs from triangular graphs and their line graphs
From MaRDI portal
Recommendations
- Codes related to line graphs of triangular graphs and permutation decoding
- Codes associated with triangular graphs and permutation decoding
- Codes from embeddings of the strong product of triangular graphs and \(K_2\) and certain induced subgraphs.
- Permutation decoding for the binary codes from triangular graphs.
- Binary codes from the complements of the triangular graphs
Cites work
- scientific article; zbMATH DE number 49061 (Why is no real title available?)
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 193433 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Binary codes of strongly regular graphs
- Codes associated with triangular graphs and permutation decoding
- Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
- Codes from the incidence matrices of graphs on 3-sets
- Information sets and partial permutation decoding for codes from finite geometries
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On defect-d matchings in graphs
- On the groups of repeated graphs
- Permutation Decoding of Systematic Codes
- Permutation decoding for the binary codes from triangular graphs.
- Searching for linear codes with large minimum distance
- The Magma algebra system. I: The user language
Cited in
(16)- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- PD-sets for the codes from incidence matrices of triangular graphs
- scientific article; zbMATH DE number 4062991 (Why is no real title available?)
- Codes from incidence matrices of \((n, 1)\)-arrangement graphs and \((n, 2)\)-arrangement graphs
- Self-orthogonal codes from row orbit matrices of strongly regular graphs
- Geometric representations of linear codes
- Binary codes from the complements of the triangular graphs
- Codes from the incidence matrices of graphs on 3-sets
- On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs.
- The weight distribution of hulls of binary codes from incidence matrices of complete graphs
- Optimal antiblocking systems of information sets for the binary codes related to triangular graphs
- Codes from embeddings of the strong product of triangular graphs and \(K_2\) and certain induced subgraphs.
- Codes associated with triangular graphs and permutation decoding
- Codes from incidence matrices of some Bouwer graphs
- Codes from incidence matrices of some regular graphs
- Codes related to line graphs of triangular graphs and permutation decoding
This page was built for publication: Codes and designs from triangular graphs and their line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651292)