Improvements on the Juxtaposing Theorem
| Data(s) |
16/09/2009
16/09/2009
2007
|
|---|---|
| Resumo |
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. |
| Identificador |
Serdica Journal of Computing, Vol. 1, No 2, (2007), 207p-212p 1312-6555 |
| Idioma(s) |
en_US |
| Publicador |
Institute of Mathematics and Informatics Bulgarian Academy of Sciences |
| Palavras-Chave | #Constant Weight Code #Juxtaposing Theorem #Optimal Code |
| Tipo |
Article |
