PD-sets for the codes from incidence matrices of triangular graphs
From MaRDI portal
Recommendations
- Codes from the incidence matrices of graphs on 3-sets
- Codes from incidence matrices and line graphs of Paley graphs
- Codes from the line graphs of complete multipartite graphs and PD-sets
- Codes from incidence matrices of graphs
- A characterization of graphs by codes from their incidence matrices
- Codes from incidence matrices of some regular graphs
- PD-sets for the codes related to some classical varieties
- Codes from incidence matrices of some Bouwer graphs
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
- Codes associated with triangular graphs and permutation decoding
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Codes and designs from triangular graphs and their line graphs
- Codes associated with triangular graphs and permutation decoding
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes
- Permutation decoding for the binary codes from triangular graphs.
This page was built for publication: PD-sets for the codes from incidence matrices of triangular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1617766)