On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods
International Journal of Communications, Network and System Sciences · 2012 · 05 (11) · 774-784
DOI: 10.4236/ijcns.2012.511081 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Communications, Network and System Sciences, 2012. Verfasst von Mohamed Askali und 3 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Askali, M., Azouaoui, A., Nouh, S., & Belkasmi, M. (2012). On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods. International Journal of Communications, Network and System Sciences, 05(11), 774-784. https://doi.org/10.4236/ijcns.2012.511081
Vancouver
Askali M, Azouaoui A, Nouh S, Belkasmi M. On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods. International Journal of Communications, Network and System Sciences. 2012;05(11):774-784. doi:10.4236/ijcns.2012.511081
BibTeX
@article{Askali2012,
author = {Askali, Mohamed and Azouaoui, Ahmed and Nouh, Saïd and Belkasmi, Mostafa},
title = {On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods},
journal = {International Journal of Communications, Network and System Sciences},
year = {2012},
volume = {05},
number = {11},
pages = {774--784},
doi = {10.4236/ijcns.2012.511081}
}
EUVIMED