Minimum weights of the Gray images for q = 8 and size = 8^6:


To get more detailed infos about the codes, click on the entries in the table.
For an explanation of what the different colors mean, look below.

n24324048566472808896104112120128136144152160168176184192200208216224232240248256264272280288296304312320328336344352360368376384392400408416424432440448456464472480488496
lin. bounds16-1722-2429-3136-3843-4549-5257-5963-6669-7376-8083-8791-9496-101104-108
best714212835424956637077849196104112119126133140147154162168176183191197204206213220227234241248256263270277284290298304312319326333340347354361368375382389397404410417
GR(64,4)-2+1+1+1+1816243240404856647280808896104104112120128136136144152160168176176184192200208216216224232240248256256264272280288296304304312320328336344344352360368376384392
GR(64,4)-2+2+1+1816243240484856647280808896104112120126128136144152160168168176184192200208216216224232240248256264264272280288296304312312320328336344352360360368376384392400408
GR(64,4)-2+2+2714212835424956637077849196104112119126133140147154162168176183191197204206213220227234241248256263270277284290298304312319326333340347354361368375382389397404410417

The color scheme indicates how the minimum distance of the Gray image compares to that of the best known linear codes over GF(8). It is as follows:
d There are linear codes over GF(8) with minimum distance higher than d.
d The best known linear codes over GF(8) have minimum distance d.
d It is possible that there are linear codes over GF(8) with minimum distance d or higher, but none is known yet (BTKL=better-than-known-linear).
d There are no linear codes over GF(8) with minimum distance d or higher (BTL=better-than-linear).
d There was no information about the corresponding linear codes over GF(8) in the database.

Back to main page