In this paper, we empoly group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to construct linear codes. Finally, we obtain some linear codes which have better parameters than the code in Grassl's code tables. All the calculation results and corresponding data are listed in the paper or posted online.