Binary Cyclic Codes With Simultaneously Large Minimum Distances and Dual Distances

Researchers proposed new binary cyclic code families of length 2^s-1 with rate near one-half.

The codes achieve simultaneously large minimum distance and dual distance, with some families nearing product bounds around n or 2n.

Many of the new examples improve on previously known codes with the same length and dimension.

The results may strengthen error correction performance and update best-known code tables.