Abstract :
In the present paper we present some tools in exploring the shadow process in self–dual codes for the purpose of finding singly even self–dual binary codes with higher minimal distances. The present paper can be viewed as a supplementary work to the preceding works (IEEE Trans. Inform. Theory 36 (1990) 1319; IEEE Trans. Inform Theory 37 (1991) 1222).
