All binary cyclic codes of odd lengths are checked from 101 to 127 to find codes which are better than those in a table by T. Verhoeff (1989). There are five such cases, namely, (117, 36, 32), (117, 37, 29), (117, 42, 26), (117, 49, 24), and (127, 36 35) cyclic codes. According to Verhoeff's table the previously known ranges of the highest minimum-distance were 28-40, 28-40, 25-37, 22-32, and 32-46, respectively. Applying constructions X and Y1, (120, 37, 32) and (108, 28, 32) codes were found. Moreover, the highest minimum-distances that cyclic codes of length 127 can attain are determined.>

A proof of V.D. Goppa's (1983) lower bound to the dimension of subfield subcodes of his geometric codes is given. A result on the minimum distance of these subfield subcodes is also given that generalizes the well-known bound: minimum distance of Gamma (L,G)>or=2 deg(G(X))+1 for classical Goppa codes Gamma (L,G) over the field F/sub 2/ with a square-free Goppa polynomial G=G(X).>