Six new binary quasi-cyclic codes
Zhi Chen · IEEE Transactions on Information Theory · 1994
Six new quasi-cyclic codes are presented, which improve the lower bounds on the minimum distance for a binary code. A local exhaustive search is used to find these codes and many other quasi-cyclic codes which attain the lower bounds.>