N. V. Semakov, V. A. Zinov'ev, G. V. Zaitsev, “A Class of Maximum Equidistant Codes”, Probl. Peredachi Inf., 5:2 (1969), 84–87; Problems Inform. Transmission, 5:2 (1969), 65

This publication is cited in the following 19 articles:

L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “Constructions of nonbinary codes meeting the Johnson bound”, Problems Inform. Transmission, 60:1 (2024), 12–20
J. Borges, V. A. Zinoviev, D. V. Zinoviev, “On the classification of completely regular codes with covering radius two and antipodal duals”, Problems Inform. Transmission, 59:3 (2023), 204–216
P. Boyvalenkov, K. Delchev, V. A. Zinoviev, D. V. Zinoviev, “On codes with distances $d$ and $n$ ”, Problems Inform. Transmission, 58:4 (2022), 352–371
Honold T. Landjev I., “On Homogeneous Arcs and Linear Codes Over Finite Chain Rings”, Appl. Algebr. Eng. Commun. Comput., 2021
P. Boyvalenkov, K. Delchev, D. V. Zinoviev, V. A. Zinoviev, “On $q$ -ary codes with two distances $d$ and $d+1$ ”, Problems Inform. Transmission, 56:1 (2020), 33–44
L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “Symmetric block designs and optimal equidistant codes”, Problems Inform. Transmission, 56:3 (2020), 245–252
J. Borges, J. Rifà, V. A. Zinoviev, “On completely regular codes”, Problems Inform. Transmission, 55:1 (2019), 1–45
Landjev I., Rousseva A., Storme L., “on Linear Codes of Almost Constant Weight and the Related Arcs”, C. R. Acad. Bulg. Sci., 72:12 (2019), 1626–1633
Polak S.C., “New Nonbinary Code Bounds Based on Divisibility Arguments”, Designs Codes Cryptogr., 86:4 (2018), 861–874
Dai P. Wang J. Yin J., “Two Series of Equitable Symbol Weight Codes Meeting the Plotkin Bound”, Des. Codes Cryptogr., 74:1 (2015), 15–29
L. A. Bassalygo, V. A. Zinoviev, “Optimal almost equisymbol codes based on difference matrices”, Problems Inform. Transmission, 50:4 (2014), 313–319
Zhu M. Ge G., “4-Gdd(6N)S and Related Optimal Quaternary Constant-Weight Codes”, J. Comb Des., 20:12 (2012), 509–526
Rifa J., Zinoviev V.A., “On Lifting Perfect Codes”, IEEE Trans Inform Theory, 57:9 (2011), 5918–5925
Borges J., Rifa J., Zinoviev V.A., “ON q-ARY LINEAR COMPLETELY REGULAR CODES WITH rho=2 AND ANTIPODAL DUAL”, Adv Math Commun, 4:4 (2010), 567–578
Ding, CS, “Optimal Constant Composition Codes From Zero-Difference Balanced Functions”, IEEE Transactions on Information Theory, 54:12 (2008), 5766
G. T. Bogdanova, V. A. Zinov'ev, T. J. Todorov, “On the Construction of $q$ -ary Equidistant Codes”, Problems Inform. Transmission, 43:4 (2007), 280–302
L. A. Bassalygo, S. M. Dodunekov, V. A. Zinov'ev, T. Helleseth, “The Gray–Rankin Bound for Nonbinary Codes”, Problems Inform. Transmission, 42:3 (2006), 197–203
Ding, CS, “Combinatorial constructions of optimal constant-composition codes”, IEEE Transactions on Information Theory, 51:10 (2005), 3671
Ding, CS, “Algebraic constructions of constant composition codes”, IEEE Transactions on Information Theory, 51:4 (2005), 1585