Codes from the incidence matrices of graphs on 3-sets
From MaRDI portal
Publication:2275405
Recommendations
Cites work
- An empty interval in the spectrum of small weight codewords in the code from points and \(k\)-spaces of \(\mathrm{PG}(n,q)\)
- Binary codes from graphs on triples
- Binary codes from graphs on triples and permutation decoding
- Binary codes from the line graph of the \(n\)-cube
- Codes and designs from triangular graphs and their line graphs
- Codes associated with triangular graphs and permutation decoding
- Codes from incidence matrices and line graphs of Hamming graphs
- Codes from incidence matrices of graphs
- Codes from lattice and related graphs, and permutation decoding
- Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
- Constructing minimal blocking sets using field reduction
- Hamiltonian uniform subset graphs
- scientific article; zbMATH DE number 53917 (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?)
- Information sets and partial permutation decoding for codes from finite geometries
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On coverings
- Partial permutation decoding for codes from finite planes
- PD-sets for the codes related to some classical varieties
- Permutation Decoding of Systematic Codes
- Ternary codes from graphs on triples
- The Magma algebra system. I: The user language
Cited in
(21)- PD-sets for the codes from incidence matrices of triangular graphs
- Codes from adjacency matrices of uniform subset graphs
- Binary codes from graphs on triples
- Codes from incidence matrices of graphs
- Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
- Ternary codes from some reflexive uniform subset graphs
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- Binary codes from reflexive uniform subset graphs on 3-sets
- Hulls of codes from incidence matrices of connected regular graphs
- Partial permutation decoding of some binary codes from graphs on triples.
- Codes associated with the odd graphs
- Codes from incidence matrices of some Bouwer graphs
- Codes from incidence matrices of some regular graphs
- Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs (2k, k, k + 1, 1)
- Intersection sets, three-character multisets and associated codes
- Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
- Linear codes and cyclic codes over finite rings and their generalizations: a survey
- Codes and designs from triangular graphs and their line graphs
- Binary codes from subset inclusion matrices
- Designer of codes: a tribute to Jennifer Key
- Codes from incidence matrices of hypergraphs
This page was built for publication: Codes from the incidence matrices of graphs on 3-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275405)
