TY  - GEN 
AU  - Pegalajar Cuéllar, Manuel
AU  - Lobillo Borrero, Francisco Javier
AU  - Navarro Garulo, Gabriel
PY  - 2023
UR  - https://hdl.handle.net/10481/99214
AB  - Finding the distance of linear codes is a key aspect to build error correcting codes, and also to design
attacks in code-based post-quantum cryptography; however, it is a NP-hard problem difficult to be addressed.
Metaheuristics, and more...
LA  - eng
KW  - Linear code
KW  - Minimum distance
KW  - Genetic algorithm
KW  - Parallel genetic algorithm
KW  - GPU-based parallel model
KW  - Post-quantum cryptography
TI  - Fast parallel computation of reduced row echelon form to find the minimum distance of linear codes
DO  - 10.1016/j.eswa.2023.119955
ER  -