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


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.

n1624324048566472808896104112120128136144152160168176184192200208216224232240248256264272280288296304312320328336344352360368376384392400408416424432440448456464472480488496
lin. bounds121925-2632-3339-404755616874-7581-8288-8996103110
best714212835424956647078849298106112120127134142148155163169176184192198205212220226233240248255262269277283290297304312319326334340347354361368376383391397404411418425432
GR(64,4)-2+1+1816243240485664647280889696104112120128136144152160168176184192192200208216224224232240248256264272280288288296304312320328336336344352360368376384392400408416424432
GR(64,4)-2+2714212835424956647078849298106112120127134142148155163169176184192198205212220226233240248255262269277283290297304312319326334340347354361368376383391397404411418425432

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