1 problem
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. Bar to beat. The…