Codes from incidence matrices of graphs (Q1951220): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10623-011-9594-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1985036259
@@ Property / OpenAlex ID: W1985036259 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004114
@@ Property / cites work: Q4004114 / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for λ′‐optimality in graphs with girth <i>g</i>
+Normal rank
@@ Property / cites work @@
+Q3922713
@@ Property / cites work: Q3922713 / rank @@
+Normal rank
@@ Property / cites work @@
+The mod \(p\) rank of incidence matrices for connected uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues and perfect matchings
@@ Property / cites work: Eigenvalues and perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000288
@@ Property / cites work: Q4000288 / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Approach to a Communications Problem
+Normal rank
@@ Property / cites work @@
+Q4856632
@@ Property / cites work: Q4856632 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing a conditional edge-connectivity of a graph
+Normal rank
@@ Property / cites work @@
+Maximally connected digraphs
@@ Property / cites work: Maximally connected digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite graphs and digraphs with maximum connectivity
+Normal rank
@@ Property / cites work @@
+On super-edge-connected digraphs and bipartite digraphs
+Normal rank
@@ Property / cites work @@
+Codes from incidence matrices and line graphs of Hamming graphs
+Normal rank
@@ Property / cites work @@
+Codes from the incidence matrices of graphs on 3-sets
+Normal rank
@@ Property / cites work @@
+Q5354524
@@ Property / cites work: Q5354524 / rank @@
+Normal rank
@@ Property / cites work @@
+Codes from incidence matrices and line graphs of Paley graphs
+Normal rank
@@ Property / cites work @@
+Chromatic number and the 2-rank of a graph
@@ Property / cites work: Chromatic number and the 2-rank of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal permutation sets for decoding the binary Golay codes (Corresp.)
+Normal rank
@@ Property / cites work @@
+Graph theoretic error-correcting codes
@@ Property / cites work: Graph theoretic error-correcting codes / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
+Normal rank
@@ Property / cites work @@
+Maximally edge-connected and vertex-connected graphs and digraphs: A survey
+Normal rank
@@ Property / cites work @@
+Q4242024
@@ Property / cites work: Q4242024 / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for maximally connected dense graphs
+Normal rank
@@ Property / cites work @@
+Q4717031
@@ Property / cites work: Q4717031 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphical codes revisited
@@ Property / cites work: Graphical codes revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic Formulas for the Probability of <i>k</i>-Connectedness of Random Graphs
+Normal rank
@@ Property / cites work @@
+Codes from lattice and related graphs, and permutation decoding
+Normal rank
@@ Property / cites work @@
+Permutation decoding for the binary codes from triangular graphs.
+Normal rank
@@ Property / cites work @@
+Partial permutation decoding for codes from finite planes
+Normal rank
@@ Property / cites work @@
+Information sets and partial permutation decoding for codes from finite geometries
+Normal rank
@@ Property / cites work @@
+Codes associated with triangular graphs and permutation decoding
+Normal rank
@@ Property / cites work @@
+Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
+Normal rank
@@ Property / cites work @@
+PD-sets for the codes related to some classical varieties
+Normal rank
@@ Property / cites work @@
+Antiblocking systems and PD-sets
@@ Property / cites work: Antiblocking systems and PD-sets / rank @@
+Normal rank
@@ Property / cites work @@
+Antiblocking decoding
@@ Property / cites work: Antiblocking decoding / rank @@
+Normal rank
@@ Property / cites work @@
+Super edge connectivity properties of connected edge symmetric graphs
+Normal rank
@@ Property / cites work @@
+Permutation Decoding of Systematic Codes
@@ Property / cites work: Permutation Decoding of Systematic Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimale \(n\)-fach kantenzusammenhängende Graphen
+Normal rank
@@ Property / cites work @@
+Q4079637
@@ Property / cites work: Q4079637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3356329
@@ Property / cites work: Q3356329 / rank @@
+Normal rank
@@ Property / cites work @@
+On coverings
@@ Property / cites work: On coverings / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for graphs to be <i>λ′</i>‐optimal and super‐<i>λ′</i>
+Normal rank
@@ Property / cites work @@
+The Connectivities of a Graph and its Complement
@@ Property / cites work: The Connectivities of a Graph and its Complement / rank @@
+Normal rank
@@ Property / cites work @@
+Q3794215
@@ Property / cites work: Q3794215 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2704926
@@ Property / cites work: Q2704926 / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
+Normal rank