LES DERNIÈRES INFORMATIONS
An Efficient method to find the Minimum Distance of Linear Block Codes
Titre | An Efficient method to find the Minimum Distance of Linear Block Codes |
Publication Type | Conference Paper |
Year of Publication | 2012 |
Authors | Askali, M, Nouh, S, Belkasmi, M |
Editor | Essaaidi, M, Zaz, Y |
Conference Name | 2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS) |
Publisher | Morocco Sect MTT/AP Joint Chapter |
ISBN Number | 978-1-4673-1520-3 |
Abstract | Finding the minimum distance of linear codes is in general a NP-hard problem, we propose an efficient algorithm to attack this problem. The principle of this approach is to search code words locally around the all-zero code word perturbed by a level of noise magnitude, in other words the maximum of noise that can be corrected by a Soft-In decoder, anticipating that the resultant nearest non-zero code words will most likely contain the minimum Hamming weight code word, whose Hamming weight is equal to the minimum distance of the linear code. A numerous results prove that the proposed algorithm is valid for general linear codes and it is very fast comparing to all others known techniques, therefore it is a good tool for computing. Comparing to Joanna's works, we proof that our algorithm has a low complexity with a fast time of execution. For some linear RQs, QDCs and BCHs codes with unknown minimum distance, we give a good estimation (true) of the minimum distance where the length is less than 439.
|
Contactez-nous
ENSIAS
Avenue Mohammed Ben Abdallah Regragui, Madinat Al Irfane, BP 713, Agdal Rabat, Maroc
Télécopie : (+212) 5 37 68 60 78
Secrétariat de direction : 06 61 48 10 97
Secrétariat général : 06 61 34 09 27
Service des affaires financières : 06 61 44 76 79
Service des affaires estudiantines : 06 62 77 10 17 / n.mhirich@um5s.net.ma
Résidences : 06 61 82 89 77
Contacts
Compteur de visiteurs:628,657
Education - This is a contributing Drupal Theme
Design by
WeebPal.