In this paper, we present the powerful scheme ZSISMP (Zimmermann Self Invertible Stabilizer Multiplier Permutation) to attack the hardness of the minimum distance search problem of BCH codes. This scheme consists in evaluating the minimum distance of the reduced dimension sub code fixed by a Self Invertible Stabilizer Multiplier Permutation by Zimmermann algorithm. The proposed scheme ZSISMP is validated on all BCH codes of known minimum distance. A comparison with several known powerful techniques proves its efficiency in giving more accurate results in short time. The use of this efficient local search had yield to determine the error correcting capability of many BCH codes of length 1023 and 4095.
| Published in | American Journal of Computer Science and Technology (Volume 1, Issue 2) |
| DOI | 10.11648/j.ajcst.20180102.11 |
| Page(s) | 39-43 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2018. Published by Science Publishing Group |
Minimum Distance, Minimum Weight, BCH Codes, Designed Distance, Automorphism Group, Multiplier, Zimmermann Algorithm
| [1] | P. Charpin, Open problems on cyclic codes, in: V. S. Pless, W. C. Human, R. A. Brualdi (Eds.), Handbook of Coding Theory, Part 1: Algebraic Coding, Elsevier, Amsterdam, The Netherlands, 1998 (Chapter 11). |
| [2] | C. Ding, X. Du, Z. Zhou, “The Bose and minimum distance of a class of BCH codes,” IEEE Trans. Inf. Theory 61 (5) (2015) 2351–2356. |
| [3] | C. Ding, “Parameters of several classes of BCH codes,” IEEE Trans. Inf. Theory 61 (10) (2015) 5322–5330. |
| [4] | Rajesh Kumar Narula, O. P. Vinocha and Ajay Kumar, “A class of non-binary BCH code of Bose and minimum distance.“ Journal of Mathematical and Computational Science (2016), No. 6, 1169-1176. |
| [5] | Cunsheng Ding, Cuiling Fan, Zhengchun Zhou “The dimension and minimum distance of two classes of primitive BCH codes” Finite Fields and Their Applications, Volume 45, May 2017, Pages 237-263. |
| [6] | Hao Liu, Cunsheng Ding, Chengju Li, “Dimensions of three types of BCH codes over GF (q)”, Discrete Mathematics, 340 (2017) 1910–1927. |
| [7] | Shuxing Li “The Minimum Distance of Some Narrow-Sense Primitive BCH Codes”. SIAM Journal on Discrete Mathematics, 2017, Vol. 31, No. 4: pp. 2530-2569. |
| [8] | Shuxing Li, Cunsheng Ding, Maosheng Xiong, and Gennian Ge, “Narrow-Sense BCH Codes Over GF (q) With Length n=qm-1/q-1,” IEEE Transactions on Information Theory (Volume: 63, Issue: 11, Nov. 2017). |
| [9] | Daniel Augot, Pascale Charpin, and Nicolas Sendrier “Studying the Locator Polynomials of Minimum Weight Codewords of BCH Codes” IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 38, NO. 3, MAY 1992. |
| [10] | D. Augot and N. Sendrier, “Idempotents and the BCH bound,” IEEE Trans. Inform. Theory, vol. 40, pp. 204–207, 1994. |
| [11] | A. Canteaut, and F. Chabaud. "A new algorithm for finding minimum-weight words in a linear code: Application to primitive narrow-sense BCH codes of length 511", IEEE Trans. Inform. Theory, IT-44 (1), pp 367-378, Jan. 1998. |
| [12] | J. Stern, “A method for finding codewords of small weight,” in Coding Theory and Applications, G. Cohen and J. Wolfmann, Eds. New York: Springer-Verlag, 1989, pp. 106–113. |
| [13] | Zimmermann K.-H., Integral Hecke Modules, Integral Generalized Reed-Muller Codes, and Linear Codes Technische Universitat HamburgHarburg, Tech. Rep. 3-96, 1996. |
| [14] | The GAP Group. “GAP–Groups, Algorithms, and Programming, Version 4.7.9”. 2015. http://www.gap-system.org. |
| [15] | Grassl, M. Searching for linear codes with large minimum distance. Discovering mathematics with Magma, pp. 287–313, Algorithms Comput. Math., 19, Springer, Berlin, 2006. |
| [16] | M. Zhang, F. Ma, Simulated annealing approach to the minimum distance of error-correcting codes, Int. J. Electron. 76 (1994) 377–384. |
| [17] | J. A. Bland, D. J. Baylis, A tabu search approach to the minimum distance of error-correcting codes, Int. J. Electron. 79 (1995) 829–837. |
| [18] | J. Wallis and K. Houghten, “A Comparative Study of Search Techniques Applied tothe Minumum Distance of BCH Codes,” Conference on Artificial Intelligence and Soft Computing, Banff, 17-19 July 2002. |
| [19] | 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, 5 (11), 774-784. |
| [20] | J. A. Bland. Local search optimisation applied to the minimum distance problem. Advanced Engineering Informatics, 21, 2007. |
| [21] | Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur, "Performance of metropolis algorithm for the minimum weight code word problem", Genetic and Evolutionary Computation Conference, 2014. |
| [22] | Bouchaib AYLAJ and Mostafa BELKASMI, “New Simulated Annealing Algorithm for Computing the Minimum Distance of Linear Block Codes”. Advances in Computational Research, indexed Google Scholar ISSN: 0975-3273, E-ISSN: 0975-9085, Volume 6, Issue 1, pp.-153-158, 2014. |
| [23] | C. Berrou, S. Vaton, M. Jezequel and C. Douillard, “Computing the Minimum Distance of Linear Codes by the Error Impulse Method,” Proceedings of IEEE Globecom, Taipei, 17-21 November 2002, pp. 10-14. |
| [24] | S. NOUH, I. A. Joundan, B. Aylaj, M. Belkasmi, A. Namir “New Efficient Scheme Based on Reduction of the Dimension in the Multiple Impulse Method to Find the Minimum Distance of Linear Codes”, International Review on Computers and Software IRECOS, Vol 11, No 9 (2016) pages 742-751. |
| [25] | W. C. Huffman and V. Pless. Fundamentals of error-correcting codes. Cambridge University Press, Cambridge, 2003. |
| [26] | R. C Bose and D. K. Ray-Chaudhuri. On a class of error correcting binary group codes. Information and Control, 3:68–79, mars 1960. |
| [27] | A. Hocquenghem. Codes correcteurs d’erreurs. Chiffres, 2:147–156, sept 1959. |
APA Style
Issam Abderrahman Joundan, Said Nouh, Abdelwahed Namir. (2018). A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes. American Journal of Computer Science and Technology, 1(2), 39-43. https://doi.org/10.11648/j.ajcst.20180102.11
ACS Style
Issam Abderrahman Joundan; Said Nouh; Abdelwahed Namir. A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes. Am. J. Comput. Sci. Technol. 2018, 1(2), 39-43. doi: 10.11648/j.ajcst.20180102.11
AMA Style
Issam Abderrahman Joundan, Said Nouh, Abdelwahed Namir. A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes. Am J Comput Sci Technol. 2018;1(2):39-43. doi: 10.11648/j.ajcst.20180102.11
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.ajcst.20180102.11,
author = {Issam Abderrahman Joundan and Said Nouh and Abdelwahed Namir},
title = {A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes},
journal = {American Journal of Computer Science and Technology},
volume = {1},
number = {2},
pages = {39-43},
doi = {10.11648/j.ajcst.20180102.11},
url = {https://doi.org/10.11648/j.ajcst.20180102.11},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajcst.20180102.11},
abstract = {In this paper, we present the powerful scheme ZSISMP (Zimmermann Self Invertible Stabilizer Multiplier Permutation) to attack the hardness of the minimum distance search problem of BCH codes. This scheme consists in evaluating the minimum distance of the reduced dimension sub code fixed by a Self Invertible Stabilizer Multiplier Permutation by Zimmermann algorithm. The proposed scheme ZSISMP is validated on all BCH codes of known minimum distance. A comparison with several known powerful techniques proves its efficiency in giving more accurate results in short time. The use of this efficient local search had yield to determine the error correcting capability of many BCH codes of length 1023 and 4095.},
year = {2018}
}
TY - JOUR T1 - A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes AU - Issam Abderrahman Joundan AU - Said Nouh AU - Abdelwahed Namir Y1 - 2018/02/21 PY - 2018 N1 - https://doi.org/10.11648/j.ajcst.20180102.11 DO - 10.11648/j.ajcst.20180102.11 T2 - American Journal of Computer Science and Technology JF - American Journal of Computer Science and Technology JO - American Journal of Computer Science and Technology SP - 39 EP - 43 PB - Science Publishing Group SN - 2640-012X UR - https://doi.org/10.11648/j.ajcst.20180102.11 AB - In this paper, we present the powerful scheme ZSISMP (Zimmermann Self Invertible Stabilizer Multiplier Permutation) to attack the hardness of the minimum distance search problem of BCH codes. This scheme consists in evaluating the minimum distance of the reduced dimension sub code fixed by a Self Invertible Stabilizer Multiplier Permutation by Zimmermann algorithm. The proposed scheme ZSISMP is validated on all BCH codes of known minimum distance. A comparison with several known powerful techniques proves its efficiency in giving more accurate results in short time. The use of this efficient local search had yield to determine the error correcting capability of many BCH codes of length 1023 and 4095. VL - 1 IS - 2 ER -
Information
Email: