Uniqueness of Some Linear Subcodes of the Extended Binary Golay Code

We prove that up to equivalence, there exist only two $[18,6,8]$ codes and only one $[n,n-12,8]$ code, $19\le n\le 23$. All the considered codes can be obtained after a suitable shortening of the binary $[24,12,8]$ Golay code.