"On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods"
written by Mohamed Askali, Ahmed Azouaoui, Saïd Nouh, Mostafa Belkasmi,
published by International Journal of Communications, Network and System Sciences, Vol.5 No.11, 2012
has been cited by the following article(s):
  • Google Scholar
  • CrossRef
[1] On the Construction of Good Double and Triple Circulant Codes using Multiple Impulse Method
[2] A new efficient way based on special stabilizer multiplier permutations to attack the hardness of the minimum weight search problem for large BCH codes
2019
[3] A new way to find the minimum distance of BCH and Quadratic Double Circulant Codes
Smart Application and Data Analysis for Smart Cities, 2018
[4] New ant colony optimization for searching the minimum distance for linear codes
2018
[5] A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes
2018
[6] CÁLCULO APROXIMADO DE LA DISTANCIA MÍNIMA DE UN CÓDIGO LINEAL
2018
[7] New Efficient and Fast Method to Compute the Weights Enumerators of Some Large Doubly Even Self Dual Quadratic Residue Codes
International Journal of Intelligent Engineering and Systems, 2018
[8] Comparative Study of Methods for Computing the Minimum Distance of Quasi-Cyclic Codes
Conference Paper, 2018
[9] Minimum distance computation of linear codes via genetic algorithms with permutation encoding
2018
[10] A Powerful Scheme Based on Fragments of Special Multiplier Permutation to Find the Minimum Distance for Large BCH Codes
International Journal of Sensors Wireless Communications and Control, 2017
[11] A Fast Method to Estimate Partial Weights Enumerators by Hash Techniques and Automorphism Group
International Journal of Advanced Computer Science and Applications, 2017
[12] Determination of partial weight enumerators of BCH codes by Hash methods
2017
[13] Design of good linear codes for a decoder based on majority voting procedure
2016
[14] Construction and iterative threshold decoding for low rates Quasi-Cyclic One Step Majority logic decodable codes
2016
[15] New Efficient Scheme Based on Reduction of the Dimension in the Multiple Impulse Method to Find the Minimum Distance of Linear Codes
2016
[16] Розв'язання динамічної задачі комівояжера з використанням поведінкової моделі колонії мурах в багатоагентних системах
2016
[17] Control Power Optimization Using Artificial Intelligence For Forward Swept Wing And Hybrid Wing Body Aircraft
2016
[18] О ВЫЧИСЛЕНИИ МИНИМАЛЬНОГО РАССТОЯНИЯ ДВОИЧНОГО ЛИНЕЙНОГО БЛОЧНОГО КОДА С ИСПОЛЬЗОВАНИЕМ ГЕНЕТИЧЕСКИХ АЛГОРИТМОВ
Современные проблемы науки и образования, 2015
[19] Performance of metropolis algorithm for the minimum weight code word problem
Proceedings of the 2014 conference on Genetic and evolutionary computation, 2014
[20] ANALYSIS MAIN APPROACHES TO THE ASSESSMENT CONTRIBUTION OF TOURISM TO THE REGIONS`S ECONOMY (ILLUSTRATED PRIMORSKII REGION)
Digital scientific journal ISSN 2070-7428, 2014
[21] New simulated annealing algorithm for computing the minimum distance of linear block codes
2014
[22] Discovery of Good Double and Triple Circulant Codes using Multiple Impulse Method
Advances in Computa-tional Research, ISSN, 2013
[23] Comparative Study of Methods for Calculating the Minimum Distance of Quasi-Cyclic Codes
2012