1 paper
M. P. Cuéllar, J. Gómez-Torrecillas, F. J. Lobillo +1
Finding the minimum distance of linear codes is an NP-hard problem. Traditionally, this computation has been addressed by means of the design of algorithms that find, by a clever e…