The following pages link to (Q3428630):
Displaying 15 items.
- Bi-resolving graph homomorphisms and extensions of bi-closing codes (Q368695) (← links)
- Codes from lattice and related graphs, and permutation decoding (Q602759) (← links)
- Binary codes from rectangular lattice graphs and permutation decoding (Q854813) (← links)
- Ternary codes from graphs on triples (Q1044933) (← links)
- Bit-optimal decoding of codes whose Tanner graphs are trees (Q1811114) (← links)
- Binary codes from graphs on triples (Q1827742) (← links)
- On the existence of PD-sets: algorithms arising from automorphism groups of codes (Q2025365) (← links)
- Ternary codes from some reflexive uniform subset graphs (Q2254533) (← links)
- Codes from the incidence matrices of graphs on 3-sets (Q2275405) (← links)
- Binary codes from reflexive uniform subset graphs on 3-sets (Q2346712) (← links)
- Hulls of codes from incidence matrices of connected regular graphs (Q2436579) (← links)
- Codes from the line graphs of complete multipartite graphs and PD-sets (Q2643315) (← links)
- Codes related to line graphs of triangular graphs and permutation decoding (Q2862815) (← links)
- (Q3171168) (← links)
- (Q4242209) (← links)