Best Linear Codes

Based on an method first described in a series of papers by Michael Braun, Axel Kohnert, Alfred Wassermann (see [1],[2] ) we constructed a large number of linear codes with prescribed minimum distance. A generator matrix of each constructed code was stored in a database.To solve the corresponding Diophantine linear systems we also used sometimes a special programm developed by Johannes Zwanzger [3].
Here we list improvements found some time ago:

new best codes

December 29, 2008 (19 new codes: 5 optimal + 5 improvements + 9 derived)

December 4, 2008 (21 new codes: 1 optimal + 9 improvements + 11 derived)

November 23, 2008 (22 new codes: 1 optimal + 10 improvements + 11 derived)

November 5, 2008 (38 new codes: 1 optimal + 10 improvements + 27 derived)

October 31, 2008 (49 new codes: 27 improvements + 22 derived)

October 21, 2008 (28 new codes: 2 optimal + 13 improvements + 13 derived)

October 6, 2008 (39 new codes: 2 optimal + 14 improvements + 23 derived)

October 1, 2008 (25 new codes: 1 optimal + 8 improvements + 16 derived)

September 25, 2008 (25 new codes: 1 optimal + 12 improvements + 12 derived)

September 15, 2008 (25 new codes: 2 optimal + 10 improvements + 13 derived)

September 6, 2008 (55 new codes: 1 optimal + 17 improvements + 37 derived)

September 1, 2008 (23 new codes: 3 optimal + 6 improvements + 14 derived)

August 18, 2008 (33 new codes: 12 improvements + 21 derived)

August 11, 2008 (21 new codes: 7 improvements + 14 derived)

August 8, 2008 (29 new codes: 1 optimal + 12 improvements + 16 derived)