Improvements on the Juxtaposing Theorem

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.

Divisible Codes - A Survey

This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.

On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes

Partially supported by the Technical University of Gabrovo under Grant C-801/2008

Semi-Smooth Newton Methods for the Time Optimal Control of Nonautonomous Ordinary Differential Equations

AMS Subj. Classification: 49J15, 49M15