【摘要】 本文利用了一类准循环码的结构进行计算机搜索，再加上通常的码的变换，共得到了七个新的二元线性码，它们都改进了文［１］中二元线性码极小距离的下界，其中有三个是最优的更多还原

【Abstract】 By using the structure of a subclass of quasi-cyclic coded to search with computer, and by applying some usual code transformation, we obtain seven new linear codes, which improve the lower bounds on theminimum distance for a binary linear cede. Three of them are optimal.更多还原