Pages that link to "Item:Q1950398"
From MaRDI portal
The following pages link to Some combinatorial aspects of constructing bipartite-graph codes (Q1950398):
Displaying 13 items.
- On constructions and parameters of symmetric configurations \(v_k\) (Q300392) (← links)
- Further results on multiple coverings of the farthest-off points (Q326345) (← links)
- Bi-resolving graph homomorphisms and extensions of bi-closing codes (Q368695) (← links)
- Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641) (← links)
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes (Q1994925) (← links)
- Multiple coverings of the farthest-off points with small density from projective geometry (Q2018430) (← links)
- Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\) (Q2147366) (← links)
- Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\) (Q2232117) (← links)
- Bounds on codes derived by counting components in Varshamov graphs (Q2491316) (← links)
- Constructions of binary codes based on bipartite graphs (Q2630779) (← links)
- (Q3511983) (← links)
- Incidence matrices for the class \({\mathcal{O}}_6\) of lines external to the twisted cubic in \(\mathrm{PG}(3,q)\) (Q6115813) (← links)
