1. Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev, V.A., Codes with Two Distances: d and d+1, in Proc. 16th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT-XVI), Svetlogorsk, Russia, Sept. 2–8, 2018, pp. 40–45. Available at https://www.dropbox.eom/s/h7u89lh8vyirww9/Proceedings%20final.pdf?dl=0.
2. Landjev, I., Rousseva, A., and Storme, L., On Linear Codes of Almost Constant Weight and the Related Arcs, C. R. Acad. Bulgare Sci., 2019, vol. 72, no. 12, pp. 1626–1633.
3. Bassalygo, L.A., New Upper Bounds for Error Correcting Codes, Probl. Peredachi Inf., 1965, vol. 1, no. 4, pp. 41–44 [Probl. Inf. Transm. (Engl. Transl.), 1965, vol. 1, no. 4, pp. 32–35].
4. Bassalygo, L.A., Zinoviev, V.A., and Lebedev, V.S., On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes, Probl. Peredachi Inf., 2018, vol. 54, no. 3, pp. 54–61 [Probl. Inf. Transm. (Engl. Transl.), 2018, vol. 54, no. 3, pp. 245–252].
5. Bassalygo, L.A. and Zinoviev, V.A., Remark on Balanced Incomplete Block Designs, Near-Resolvable Block Designs, and q-ary Constant-Weight Codes, Probl. Peredachi Inf., 2017, vol. 53, no. 1, pp. 55–59 [Probl. Inf. Transm. (Engl. Transl.), 2017, vol. 53, no. 1, pp. 51–54].