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]. The following links allow to access this database for the listed combinations of field size q and dimension k.

Links to tables

recently found new best codes

March 11, 2013 (35 new codes:3 optimal +17 improvements + 15 derived)

August 17, 2012 (51 new codes:2 optimal +18 improvements + 31 derived)

March 26, 2012 (36 new codes:3 optimal +14 improvements + 19 derived)

May 16, 2011 (23 new codes:3 optimal +9 improvements + 11 derived)

November 3, 2010 (77 new codes:1 optimal +27 improvements + 49 derived)

April 28, 2010 (63 new codes:8 optimal +22 improvements + 33 derived)

Februar 15, 2010 (54 new codes:1 optimal + 21 improvements + 32 derived)

January 4, 2010 (65 new codes:10 optimal + 23 improvements + 32 derived)

December 13, 2009 (35 new codes:3 optimal + 20 improvements + 12 derived)

August 10, 2009 (48 new codes:3 optimal + 19 improvements + 26 derived)

June 5, 2009 (44 new codes: 16 improvements + 28 derived)

May 4, 2009 (40 new codes: 3 optimal + 15 improvements + 22 derived)

February 25, 2009 (30 new codes: 1 optimal + 11 improvements + 18 derived)

February 2, 2009 (23 new codes: 8 improvements + 15 derived)

January 26, 2009 (71 new codes: 2 optimal + 26 improvements + 43 derived)

January 13, 2009 (26 new codes: 10 improvements + 16 derived)

Codes (452 new codes: 21 optimal + 172 improvements + 259 derived) constructed between August 2008 and December 2008 can be found here.