Uniqueness of certain completely regular Hadamard codes

J. Math. Phys., Mass. Inst. Techn. 12, 321–333 (1933)

Todd, J.: A combinatorial problem · 1933

Earlier work this paper cites.

Information and Control 2, 183–194 (1959)

Bose, R.C., Shrikhande, S.S.: A note on a result in the theory of code construction · 1959

Earlier work this paper cites.

Arch. Math. (Basel) 13, 334–340 (1962)

Hall Jr., M.: Note on the Mathieu group · 1962

Earlier work this paper cites.

Amer. J. Math. 87, 761–778 (1965)

Hughes, D.R.: On · 1965

Earlier work this paper cites.

Philips Res. Rep. Suppl. (10), vi+97 (1973)

Delsarte, P.: An algebraic approach to the association schemes of coding theory · 1973

Earlier work this paper cites.

In: Combinatorics (Proc. NATO Advanced Study Inst., Breukelen, 1974), pp. 158–178. Math. Centre Tracts, No. 55. Math. Centrum, Amsterdam (1974)

van Lint, J.H.: Recent results on perfect codes and related topics · 1974

Earlier work this paper cites.

Philips Res. Rep. 30, 9–36 (1975)

Goethals, J.M., van Tilborg, H.C.A.: Uniformly packed codes · 1975

Earlier work this paper cites.

Problemy Peredači Informacii 13(3), 22–25 (1977)

Bassalygo, L.A., Zinov · 1977

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

Cited alongside, same era.

Oxford University Press, Eynsham (1985)

Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A., Wilson, R.A.: Atlas of finite groups · 1985

Cited alongside, same era.

Springer-Verlag, Berlin (1989)

Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-regular graphs, · 1989

Cited alongside, same era.

Discrete Math. 81(2), 193–201 (1990)

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

Cited alongside, same era.

Cambridge University Press, Cambridge (1991)

Cameron, P.J., van Lint, J.H.: Designs, graphs, codes and their links, · 1991

Cited alongside, same era.

Discrete Math. 106/107, 353–360 (1992)

Neumaier, A.: Completely regular codes · 1992

Cited alongside, same era.

Proceedings of 2004 Com2MaC Workshop on Distance-Regular Graphs and Finite Geometry pp. 43–56 (2004)

Martin, W.J.: Completely regular codes — a viewpoint and some problems · 2004

Later among the works it cites.

Problemy Peredachi Informatsii 43(2), 34–51 (2007)

Zinov · 2007

Later among the works it cites.

Discrete Math. 308(16), 3508–3525 (2008)

Borges, J., Rifà, J., Zinoviev, V.A.: On non-antipodal binary completely regular codes · 2008

Later among the works it cites.

Discrete Math. 309(16), 5011–5016 (2009)

Rifà, J., Zinoviev, V.A.: On a class of binary linear completely transitive codes with arbitrary covering radius · 2009

Later among the works it cites.

Adv. Math. Commun. 4(4), 567–578 (2010)

Borges, J., Rifà, J., Zinoviev, V.A.: On · 2010

Later among the works it cites.

IEEE Trans. Inform. Theory 56(1), 266–272 (2010)

Rifà, J., Zinoviev, V.A.: New completely regular · 2010

Later among the works it cites.