Codes from incidence matrices of graphs
From MaRDI portal
Publication:1951220
DOI10.1007/s10623-011-9594-xzbMath1264.05012OpenAlexW1985036259MaRDI QIDQ1951220
Peter Dankelmann, Bernardo Gabriel Rodrigues, Jennifer D. Key
Publication date: 30 May 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9594-x
weight enumeratorincidence matriceserror correctionpermutation decodingbinary codeedge connectivityp-ary codes
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Paths and cycles (05C38)
Related Items
Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd, GHWs of codes arising from Cartesian product of graphs, GHWs of codes derived from the incidence matrices of some graphs, Permutation decoding of codes from generalized Paley graphs, Codes associated with the odd graphs, A characterization of graphs by codes from their incidence matrices, On the structure of matroids arising from the gain graphs, Binary codes of some strongly regular subgraphs of the McLaughlin graph, Linear codes and cyclic codes over finite rings and their generalizations: a survey, The weight distribution of hulls of binary codes from incidence matrices of complete graphs, On some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \), Zero-divisor super-\(\lambda\) graphs, Hulls of codes from incidence matrices of connected regular graphs, Local WL invariance and hidden shades of regularity, Ternary codes from some reflexive uniform subset graphs, Codes from incidence matrices and line graphs of Hamming graphs, Codes from the incidence matrices of graphs on 3-sets, Generalized Hamming weights of projective Reed-Muller-type codes over graphs, PD-sets for codes related to flag-transitive symmetric designs, Linear codes over signed graphs, Binary codes from Paley graphs of prime-power-square order, Binary codes from reflexive uniform subset graphs on 3-sets, Stopping sets of codes from complete graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes from incidence matrices and line graphs of Paley graphs
- Codes from lattice and related graphs, and permutation decoding
- Codes associated with triangular graphs and permutation decoding
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Codes from incidence matrices and line graphs of Hamming graphs
- Antiblocking decoding
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Sufficient conditions for maximally connected dense graphs
- On computing a conditional edge-connectivity of a graph
- The mod \(p\) rank of incidence matrices for connected uniform hypergraphs
- Permutation decoding for the binary codes from triangular graphs.
- Eigenvalues and perfect matchings
- Partial permutation decoding for codes from finite planes
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Chromatic number and the 2-rank of a graph
- Bipartite graphs and digraphs with maximum connectivity
- Codes from the incidence matrices of graphs on 3-sets
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- On coverings
- Antiblocking systems and PD-sets
- Information sets and partial permutation decoding for codes from finite geometries
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- PD-sets for the codes related to some classical varieties
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- The Connectivities of a Graph and its Complement
- On super-edge-connected digraphs and bipartite digraphs
- Maximally connected digraphs
- Super edge connectivity properties of connected edge symmetric graphs
- Graphical codes revisited
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
- A Graph-Theoretic Approach to a Communications Problem
- Graph theoretic error-correcting codes
- Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
- Permutation Decoding of Systematic Codes
