On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes
- 2 Downloads
We introduce m-near-resolvable block designs. We establish a correspondence between such block designs and a subclass of (optimal equidistant) q-ary constant-weight codes meeting the Johnson bound. We present constructions of m-near-resolvable block designs, in particular based on Steiner systems and super-simple t-designs.
Unable to display preview. Download preview PDF.
- 4.Abel, R.J.R., Ge, G., and Yin, J., Resolvable and Near-Resolvable Designs, Sec. VI.7 of Handbook of Combinatorial Designs, Colbourn, C.J. and Dinitz, J.H., Eds., Boca Raton: Chapman & Hall, 2007, 2nd ed., pp. 124–132.Google Scholar
- 7.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].Google Scholar
- 11.Zaitsev, G.V., Zinoviev, V.A., and Semakov, N.V., Interrelation of Preparata and Hamming Codes and Extension of Hamming Codes to New Double-Error-Correcting Codes, Proc. 2nd Int. Sympos. on Information Theory, Tsakhkadsor, Armenia, USSR, Sept. 2–8, 1971, Petrov, P.N. and Csaki, F., Eds., Budapest: Akad. Kiadó, 1973, pp. 256–263.Google Scholar