Complete and Quasi-complete Balanced Codes

Complete balanced codes are isomorphic to Steiner systems. To each complete balanced code there corresponds a definite quasi-complete balanced code. A quasi-complete balanced code ($n=16$, $w=d=6$ and $N=112$) is given which is not connected with the complete code. This code is also interesting because it generates a maximum non-linear systematic quasi-complete (in the usual sense) code $n=15$, $d=5$ and $N=256$.