Improvements on the Juxtaposing Theorem
Serdica Journal of Computing, Tome 1 (2007) no. 2, pp. 207-212
Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library
A new class of binary constant weight codes is presented. We
establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥
min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2,
in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.
Keywords:
Constant Weight Code, Juxtaposing Theorem, Optimal Code
@article{SJC_2007_1_2_a6,
author = {Gashkov, Igor and Larsson, Henrik},
title = {Improvements on the {Juxtaposing} {Theorem}},
journal = {Serdica Journal of Computing},
pages = {207--212},
publisher = {mathdoc},
volume = {1},
number = {2},
year = {2007},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SJC_2007_1_2_a6/}
}
Gashkov, Igor; Larsson, Henrik. Improvements on the Juxtaposing Theorem. Serdica Journal of Computing, Tome 1 (2007) no. 2, pp. 207-212. http://geodesic.mathdoc.fr/item/SJC_2007_1_2_a6/