Codes from adjacency matrices of uniform subset graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- scientific article; zbMATH DE number 863484 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Association schemes and coding theory
- Binary codes and partial permutation decoding sets from the Johnson graphs
- Binary codes and partial permutation decoding sets from the odd graphs
- Binary codes from graphs on triples
- Binary codes from reflexive uniform subset graphs on 3-sets
- Linear codes with complementary duals
- On the p-ranks of the adjacency matrices of distance-regular graphs
- On the spectra of Johnson graphs
- On the spectrum of the Johnson graphs \(J(n,k,r)\)
- Ternary codes from graphs on triples
- Ternary codes from some reflexive uniform subset graphs
- The Magma algebra system. I: The user language
- \(LCD\) codes from adjacency matrices of graphs
Cited in
(9)- Ternary codes from some reflexive uniform subset graphs
- A characterization of graphs by codes from their incidence matrices
- scientific article; zbMATH DE number 1440644 (Why is no real title available?)
- Binary codes from graphs on triples
- Codes from the incidence matrices of graphs on 3-sets
- \(LCD\) codes from adjacency matrices of graphs
- Dominating sets for uniform subset graphs
- Binary codes from reflexive uniform subset graphs on 3-sets
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph
This page was built for publication: Codes from adjacency matrices of uniform subset graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706431)