Improvements on the Juxtaposing Theorem

Authors

  • Igor Gashkov
  • Henrik Larsson

DOI:

https://doi.org/10.55630/sjc.2007.1.207-212

Keywords:

Constant Weight Code, Juxtaposing Theorem, Optimal Code

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.

Downloads

Published

2007-07-04

Issue

Section

Articles