Neighbour transitivity on codes in Hamming graphs

The M.I.T. Press, Cambridge, Mass.-London (1972)

Peterson, W.W., Weldon Jr., E.J.: Error-Correcting Codes, second edn · 1972

Earlier work this paper cites.

North-Holland Publishing Co., Amsterdam (1977)

MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes · 1977

Earlier work this paper cites.

Springer-Verlag, Berlin (1989)

Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs, Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)] , vol. 18 · 1989

Earlier work this paper cites.

Discrete Math. 81

Solé, P.: Completely regular codes and completely transitive codes · 1990

Earlier work this paper cites.

Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York (1998)

Pless, V.: Introduction to the Theory of Error-Correcting Codes, third edn · 1998

Cited alongside, same era.

European J. Combin. 20

Giudici, M., Praeger, C.E.: Completely transitive codes in Hamming graphs · 1999

Cited alongside, same era.

IEEE Trans. Inform. Theory 46

Borges, J., Rifà, J.: On the nonexistence of completely transitive codes · 2000

Cited alongside, same era.

IEEE Trans. Inform. Theory 47

Borges, J., Rifà, J., Zinoviev, V.: Nonexistence of completely transitive codes with error-correcting capability e > 3 e>3 · 2001

Cited alongside, same era.

Cambridge University Press, Cambridge (2003)

Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes · 2003

Later among the works it cites.

Ph.D. thesis, The University of Western Australia, Perth, Australia (2011)

Gillespie, N.I.: Neighbour Transitivity on Codes in Hamming graphs · 2011

Closest in time.

Preprint (2011)

Gillespie, N.I., Praeger, C.E.: Uniqueness of certain completely regular Hadamard codes · 2011

Closest in time.