Browse problems

1 problem

Linear code beating the Grassl table open

Find a linear code over \mathrm{GF}(q) of length n and dimension k whose minimum distance d exceeds the best one known for those parameters.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0