Completely regular codes
From MaRDI portal
Publication:1199625
DOI10.1016/0012-365X(92)90565-WzbMath0754.94010MaRDI QIDQ1199625
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On the non-existence of extended 1-perfect codes and MDS codes, Entry-faithful 2-neighbour transitive codes, Distance-regular graphs of large diameter that are completely regular clique graphs, Quotients of association schemes, Maximal metrically regular sets, Completely regular codes in Johnson and Grassmann graphs with small covering radii, The subconstituent algebra of a strongly regular graph, On the coset graph construction of distance-regular graphs, Intriguing sets of vertices of regular graphs, A note on binary completely regular codes with large minimum distance, On a family of binary completely transitive codes with growing covering radius, A general construction of strictly Neumaier graphs and a related switching, Completely regular clique graphs, On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes, The smallest strictly Neumaier graph and its generalisations, On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph, Metric complements to subspaces in the Boolean cube, On new infinite families of completely regular and completely transitive codes, 1-homogeneous graphs with cocktail party \({\mu}\)-graphs, Geometric aspects of 2-walk-regular graphs, New families of completely regular codes and their corresponding distance regular coset graphs, Regular sets in Cayley graphs, On completely regular codes, On metric regularity of Reed-Muller codes, On new completely regular \(q\)-ary codes, On the Kronecker Product Construction of Completely Transitive q-Ary Codes, Characters and Brauer trees of the covering group of ²𝐸₆(2), Conway’s groupoid and its relatives, Diagonally neighbour transitive codes and frequency permutation arrays, On non-antipodal binary completely regular codes, ON METRIC COMPLEMENTS AND METRIC REGULARITY IN FINITE METRIC SPACES, About non equivalent completely regular codes with identical intersection array, Completely regular codes with different parameters giving the same distance-regular coset graphs, Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency, On Perfect 2‐Colorings of Johnson Graphs J(v, 3), Completely regular codes by concatenating Hamming codes, Conway groupoids and completely transitive codes, Neighbour-transitive codes in Johnson graphs, On completely regular and completely transitive supplementary codes, Completely transitive codes in Hamming graphs, A lower bound on the size of the largest metrically regular subset of the Boolean cube, On the classification of binary completely transitive codes with almost-simple top-group, Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs, On a class of binary linear completely transitive codes with arbitrary covering radius, Metric coset schemes revisited, On completely regular binary codes and t-designs∗, Families of nested completely regular codes and distance-regular graphs, Completely regular designs of strength one, Completely regular clique graphs. II
Cites Work
