International Journal of Communications, Network and System Sciences

Vol.5 No.11(2012), Paper ID 24685, 11 pages

DOI:10.4236/ijcns.2012.511081

 

On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

 

Mohamed Askali, Ahmed Azouaoui, Saïd Nouh, Mostafa Belkasmi

 

SIME Lab, National School of Computer Science and Systems Analysis (ENSIAS), Mohammed V-Souisi University, Rabat, Morocco
SIME Lab, National School of Computer Science and Systems Analysis (ENSIAS), Mohammed V-Souisi University, Rabat, Morocco
SIME Lab, National School of Computer Science and Systems Analysis (ENSIAS), Mohammed V-Souisi University, Rabat, Morocco
SIME Lab, National School of Computer Science and Systems Analysis (ENSIAS), Mohammed V-Souisi University, Rabat, Morocco

 

Copyright © 2012 Mohamed Askali, Ahmed Azouaoui, Saïd Nouh, Mostafa Belkasmi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

How to Cite this Article


M. Askali, A. Azouaoui, S. Nouh and M. Belkasmi, "On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods," International Journal of Communications, Network and System Sciences, Vol. 5 No. 11, 2012, pp. 774-784. doi: 10.4236/ijcns.2012.511081.

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.