The following pages link to Completely regular codes (Q1199625):
Displaying 50 items.
- Completely regular clique graphs. II (Q256544) (← links)
- Entry-faithful 2-neighbour transitive codes (Q281316) (← links)
- A note on binary completely regular codes with large minimum distance (Q389210) (← links)
- On a family of binary completely transitive codes with growing covering radius (Q394307) (← links)
- Completely regular clique graphs (Q402941) (← links)
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes (Q403556) (← links)
- Completely regular codes with different parameters giving the same distance-regular coset graphs (Q526258) (← links)
- Intriguing sets of vertices of regular graphs (Q604997) (← links)
- On complete regularity of extended codes (Q686177) (← links)
- Conway groupoids and completely transitive codes (Q722342) (← links)
- Completely regular codes and completely transitive codes (Q911558) (← links)
- A note on completely regular codes (Q918943) (← links)
- On new completely regular \(q\)-ary codes (Q926628) (← links)
- On non-antipodal binary completely regular codes (Q932675) (← links)
- Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs (Q1043847) (← links)
- On a class of binary linear completely transitive codes with arbitrary covering radius (Q1044974) (← links)
- Lloyd's theorem for perfect codes (Q1243264) (← links)
- Metric coset schemes revisited (Q1296146) (← links)
- Completely regular designs of strength one (Q1321590) (← links)
- Regulus codes (Q1336654) (← links)
- Quotients of association schemes (Q1345874) (← links)
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs (Q1410769) (← links)
- Distance-regular graphs of large diameter that are completely regular clique graphs (Q1631384) (← links)
- About non equivalent completely regular codes with identical intersection array (Q1743305) (← links)
- Completely regular codes by concatenating Hamming codes (Q1783729) (← links)
- Completely transitive codes in Hamming graphs (Q1817591) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- On the non-existence of extended 1-perfect codes and MDS codes (Q2120824) (← links)
- Completely regular codes in Johnson and Grassmann graphs with small covering radii (Q2152798) (← links)
- On the coset graph construction of distance-regular graphs (Q2166290) (← links)
- On metric regularity of Reed-Muller codes (Q2220768) (← links)
- On completely regular and completely transitive supplementary codes (Q2286593) (← links)
- A lower bound on the size of the largest metrically regular subset of the Boolean cube (Q2311430) (← links)
- Families of nested completely regular codes and distance-regular graphs (Q2346713) (← links)
- Uniqueness of certain completely regular Hadamard codes (Q2349177) (← links)
- The subconstituent algebra of a strongly regular graph (Q2388446) (← links)
- The smallest strictly Neumaier graph and its generalisations (Q2420557) (← links)
- Geometric aspects of 2-walk-regular graphs (Q2435427) (← links)
- New families of completely regular codes and their corresponding distance regular coset graphs (Q2436559) (← links)
- Diagonally neighbour transitive codes and frequency permutation arrays (Q2454089) (← links)
- Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency (Q2485947) (← links)
- Neighbour-transitive codes in Johnson graphs (Q2510649) (← links)
- Maximal metrically regular sets (Q2633509) (← links)
- Regular sets in Cayley graphs (Q2701120) (← links)
- An algebraic characterization of completely regular codes in distance-regular graphs (Q2784498) (← links)
- Arithmetic completely regular codes (Q2808536) (← links)
- Metric complements to subspaces in the Boolean cube (Q2959187) (← links)
- On completely regular binary codes and t-designs∗ (Q3438940) (← links)
- On the Kronecker Product Construction of Completely Transitive q-Ary Codes (Q3540933) (← links)
- On a categorial isomorphism between a class of completely regular codes and a class of distance regular graphs (Q3975181) (← links)
