Partial permutation decoding of some binary codes from graphs on triples.
From MaRDI portal
Recommendations
- Binary codes from graphs on triples and permutation decoding
- Permutation decoding for the binary codes from triangular graphs.
- Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs (2k, k, k + 1, 1)
- Codes from the incidence matrices of graphs on 3-sets
- Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
Cited in
(12)- Ternary codes from graphs on triples
- Permutation decoding for the binary codes from triangular graphs.
- Partial permutation decoding for codes from finite planes
- Binary codes from graphs on triples
- Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- Codes from the incidence matrices of graphs on 3-sets
- Codes related to line graphs of triangular graphs and permutation decoding
- Binary codes from graphs on triples and permutation decoding
- Permutation decoding of codes from generalized Paley graphs
- Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs (2k, k, k + 1, 1)
- Designer of codes: a tribute to Jennifer Key
This page was built for publication: Partial permutation decoding of some binary codes from graphs on triples.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011733)
