We classify binary completely regular codes of length m with minimum distance δ for ( m , δ ) = ( 12 , 6 ) and ( 11 , 5 ) and prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard codes.Expand

Constant composition codes have been proposed as suitable coding schemes to solve the narrow band and impulse noise problems associated with powerline communication, while at the same time… Expand

In his doctoral thesis, Snover proved that any binary $(m,256,\delta)$ code is equivalent to the Nordstrom-Robinson code or the punctured Nordstrom-Robinson code for $(m,\delta)=(16,6)$ or $(15,5)$… Expand

This paper studies the subfamily of completely transitive codes in Hamming graphs, those in which an automorphism group is transitive on each part of the distance partition.Expand

The existence of a set of d pairwise equiangular complex lines (a SIC-POVM) in ddimensional Hilbert space is currently known only for a finite set of dimensions d. We prove that, if there exists a… Expand

Twisted permutation codes, introduced recently by the second and third authors, are frequency permutation arrays that are obtained by a repetition construction applied to a smaller code.Expand

We consider codes of length m over an alphabet of size q as subsets of the vertex set of the Hamming graph = H(m,q). A code for which there exists an automorphism group X 6 Aut() that acts… Expand

We give a classification of $$2$$2-neighbour transitive codes, with minimum distance $$\delta \geqslant 5$$δ⩾5, for which $$X$$X acts faithfully on the set of entries of the Hamming graph.Expand