Improvements on the Juxtaposing Theorem

Gashkov, Igor, and Larsson, Henrik. "Improvements on the Juxtaposing Theorem." Serdica Journal of Computing 1.2 (2007): 207-212. <http://eudml.org/doc/11420>.

@article{Gashkov2007,
abstract = {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.},
author = {Gashkov, Igor, Larsson, Henrik},
journal = {Serdica Journal of Computing},
keywords = {Constant Weight Code; Juxtaposing Theorem; Optimal Code; constant-weight codes},
language = {eng},
number = {2},
pages = {207-212},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Improvements on the Juxtaposing Theorem},
url = {http://eudml.org/doc/11420},
volume = {1},
year = {2007},
}

TY - JOUR
AU - Gashkov, Igor
AU - Larsson, Henrik
TI - Improvements on the Juxtaposing Theorem
JO - Serdica Journal of Computing
PY - 2007
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 1
IS - 2
SP - 207
EP - 212
AB - 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.
LA - eng
KW - Constant Weight Code; Juxtaposing Theorem; Optimal Code; constant-weight codes
UR - http://eudml.org/doc/11420
ER -