TY  - GEN 
AU  - Pegalajar Cuéllar, Manuel
AU  - Gómez Torrecillas, José
AU  - Lobillo Borrero, Francisco Javier
AU  - Navarro Garulo, Gabriel
PY  - 2020
UR  - http://hdl.handle.net/10481/69667
AB  - 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 exhaustive search, a linear
combination of some generating matrix rows...
LA  - eng
PB  - Elsevier
TI  - Genetic algorithms with permutation-based representation for computing the distance of linear codes
DO  - 10.1016/j.swevo.2020.100797
ER  -