N. V. Semakov and V. A. Zinoviev, “Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs,” Problemi peredachi Informatsii, Vol. 4, No. 2, pp. 3–10, 1968.

has been cited by the following article:

• TITLE: Lexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements

  AUTHORS: Todor Todorov, Galina Bogdanova, Teodora Yorgova

  KEYWORDS: Lexicographic Codes, Equidistant Codes, Constant-Weight Codes, Bounds of Codes

  JOURNAL NAME: Intelligent Information Management, Vol.2 No.3, March 31, 2010

  ABSTRACT: In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w < n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.