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

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

International Journal of Communications, Network and System Sciences

ISSN Print: 1913-3715
ISSN Online: 1913-3723
www.scirp.org/journal/ijcns
E-mail: ijcns@scirp.org

Google-based Impact Factor: 0.66
Citations h5-index & Ranking

Journals Menu

"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]	Mutation-Based Algebraic Artificial Bee Colony Algorithm for Computing the Distance of Linear Codes
	Turkish Journal of Mathematics …, 2022

[3]	On the Computation of the Automorphisms Group of Some Optimal Codes Using Genetic Algorithm
	Journal of Hunan …, 2022

[4]	Finding Good Binary Linear Block Codes based on Hadamard Matrix and Existing Popular Codes
	… Journal of Advanced …, 2021

[5]	Genetic algorithms with permutation-based representation for computing the distance of linear codes
	2020

[6]	Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces
	2020

[7]	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

[8]	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

[9]	A new way to find the minimum distance of BCH and Quadratic Double Circulant Codes
	Smart Application and Data Analysis for Smart Cities, 2018

[10]	New ant colony optimization for searching the minimum distance for linear codes
	2018

[11]	A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes
	2018

[12]	CÁLCULO APROXIMADO DE LA DISTANCIA MÍNIMA DE UN CÓDIGO LINEAL
	2018

[13]	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

[14]	Comparative Study of Methods for Computing the Minimum Distance of Quasi-Cyclic Codes
	Conference Paper, 2018

[15]	Minimum distance computation of linear codes via genetic algorithms with permutation encoding
	2018

[16]	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

[17]	A Fast Method to Estimate Partial Weights Enumerators by Hash Techniques and Automorphism Group
	International Journal of Advanced Computer Science and Applications, 2017

[18]	Determination of partial weight enumerators of BCH codes by Hash methods
	2017

[19]	Design of good linear codes for a decoder based on majority voting procedure
	2016

[20]	Construction and iterative threshold decoding for low rates Quasi-Cyclic One Step Majority logic decodable codes
	2016

[21]	New Efficient Scheme Based on Reduction of the Dimension in the Multiple Impulse Method to Find the Minimum Distance of Linear Codes
	2016

[22]	Розв'язання динамічної задачі комівояжера з використанням поведінкової моделі колонії мурах в багатоагентних системах
	2016

[23]	Control Power Optimization Using Artificial Intelligence For Forward Swept Wing And Hybrid Wing Body Aircraft
	2016

[24]	О ВЫЧИСЛЕНИИ МИНИМАЛЬНОГО РАССТОЯНИЯ ДВОИЧНОГО ЛИНЕЙНОГО БЛОЧНОГО КОДА С ИСПОЛЬЗОВАНИЕМ ГЕНЕТИЧЕСКИХ АЛГОРИТМОВ
	Современные проблемы науки и образования, 2015

[25]	Performance of metropolis algorithm for the minimum weight code word problem
	Proceedings of the 2014 conference on Genetic and evolutionary computation, 2014

[26]	ANALYSIS MAIN APPROACHES TO THE ASSESSMENT CONTRIBUTION OF TOURISM TO THE REGIONS`S ECONOMY (ILLUSTRATED PRIMORSKII REGION)
	Digital scientific journal ISSN 2070-7428, 2014

[27]	New simulated annealing algorithm for computing the minimum distance of linear block codes
	2014

[28]	Discovery of Good Double and Triple Circulant Codes using Multiple Impulse Method
	Advances in Computa-tional Research, ISSN, 2013

[29]	Comparative Study of Methods for Calculating the Minimum Distance of Quasi-Cyclic Codes
	2012

[1]	Mutation-Based Algebraic Artificial Bee Colony Algorithm for Computing the Distance of Linear Codes Turkish Journal of Mathematics and Computer Science, 2022 DOI:10.47000/tjmcs.982426

[2]	Mutation-Based Algebraic Artificial Bee Colony Algorithm for Computing the Distance of Linear Codes Turkish Journal of Mathematics and Computer Science, 2022 DOI:10.47000/tjmcs.982426

[3]	Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces IEEE Transactions on Evolutionary Computation, 2020 DOI:10.1109/TEVC.2020.2980111

[4]	Minimum distance computation of linear codes via genetic algorithms with permutation encoding ACM Communications in Computer Algebra, 2019 DOI:10.1145/3313880.3313886

[5]	Minimum distance computation of linear codes via genetic algorithms with permutation encoding ACM Communications in Computer Algebra, 2019 DOI:10.1145/3313880.3313886

[6]	A New Way to Find the Minimum Distance of BCH and Quadratic Double Circulant Codes SSRN Electronic Journal , 2018 DOI:10.2139/ssrn.3176115

[7]	New ant colony optimization for searching the minimum distance for linear codes 2018 International Conference on Advanced Communication Technologies and Networking (CommNet), 2018 DOI:10.1109/COMMNET.2018.8360246

[8]	Construction and iterative threshold decoding for low rates Quasi-Cyclic One Step Majority logic decodable codes 2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS), 2016 DOI:10.1109/ACOSIS.2016.7843944

[9]	Design of good linear codes for a decoder based on majority voting procedure 2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS), 2016 DOI:10.1109/ACOSIS.2016.7843918

[10]	Performance of metropolis algorithm for the minimum weight code word problem Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014 DOI:10.1145/2576768.2598274

[11]	Performance of metropolis algorithm for the minimum weight code word problem Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014 DOI:10.1145/2576768.2598274

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

International Journal of Communications, Network and System Sciences

International Journal of Communications, Network and System Sciences

Journals Menu

Home

About SCIRP

Service

Policies