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


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. bounds17-1824-2530-3238-3944-4651-5358-6065-6772-7478-8185-8892-95100-102106-109
best816243240485656647178859296104112120127135142149155162169176184192198205212219224232240248255262269276282288296304311318325332336344352360367375382389396401408416424
GR(64,4)-2+1+1+1816243240484856647280889696104112120128128136144152160168176184184192200208216224224232240248256264272272280288296304312320320328336344352360368368376384392400408
GR(64,4)-2+2+1816243240485656647178859296104112120127135142149155162169176184192198205212219224232240248255262269276282288296304311318325332336344352360367375382389396401408416424

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