Home   /   Contact us

فارسی   /   Mobile

Thursday 1 October 2020




Mohammad Gholami

Associate Professor

Applied Mathematics

Faculty of Methematical Sciences

Tel: 03832324401-2318

gholami-m@sci.sku.ac.ir

Click to view the complete profile


Research Interest

Academic Resume
   Phd, , Isfahan University of Technology, Iran، Graduation Date: 2009
   Master, , Sharif University of Technology, Iran، Graduation Date: 2003
   Bachelor, , University of Isfahan, Iran، Graduation Date: 2001

Publications
International Journal
1. M Gholami, A Nassaj, LDPC codes based on Mobius transformations , IET Communications 13 (11), 1615 – 1624; 2019 Mar 29.
2. Z Gholami, M Gholami, Anti Quasi-Cyclic LDPC Codes , IEEE Communications Letters 22 (6), 1116 - 1119; 2018
3. M Gholami, M Alinia, Z Rahimi, An explicit method for construction of CTBC codes with girth 6 , AEU-International Journal of Electronics and Communications 74, 183-191; 2017
4. M Gholami, M Alinia, Explicit APM-LDPC codes with girths 6, 8, and 10 , IEEE Signal Processing Letters 24 (6), 741-745; 2017
5. M Gholami, Z Gholami, An explicit method to generate some QC LDPC codes with girth 8 , Iranian Journal of Science and Technology, Transactions A: Science. 2016 Jun 1;40(2):145-9.
6. M Gholami, M Alinia, High-performance binary and non-binary low-density parity-check codes based on affine permutation matrices , IET Communications 9 (17), 2114-2123; 2015
7. M Gholami, A Nassaj, Row and column extensions of 4-cycle free LDPC codes , IEEE Communications Letters 20 (1), 25-28; 2015
8. M. Gholami, G, Raeisi, Column large girth column-weight two and three LDPC codes , IEEE Communications Letters, vol. 18, no. 10, Oct. 2014.
9. M. Gholami, M. Esmaeili, M. Samadieh, Quasi cyclic LDPC codes based on finite set systems , IET Communications, vol. 8, pp. 1837–1849, July 2014.
10. P. K. Beiranvand, R. Beyranvand, and M. Gholami, Classification of finite rings on order p6 by generators and relations , Article ID 467905, Journal of Mathematics, vol. 2013, pp. 1-8, 2013.
11. M. Gholami, M. Samadieh, G. Raeisi , Column-weight three QC LDPC codes with girth 20 , IEEE Commun. Lett., vol. 17, no. 7, July 2013.
12. M. Gholami, M. Samadieh, Design of binary and nonbinary codes from lifting of girth-8 cycle codes with minimum lengths , IEEE Commun. Lett., vol. 17, pp. 777-780, 2013.
13. M. Gholami, M. Samadieh, Convolutional cylinder-type block-circulant cycle codes , Transactions on Combinatorics, vol. 2, pp. 9-17, 2013.
14. M. Gholami, M. Esmaeili , Maximum-girth cylinder-type block-circulant LDPC codes , IEEE Transactions on Communications, vol. 60, no. 4, pp. 952-962, 2012.
15. M. Gholami, F. S. Mostafaiee , On the girth of Tanner (3,7) quasi-cyclic LDPC codes , Transactions on Combinatorics, vol. 1, no. 2, pp. 1-16, 2012.
16. M. Gholami, Division of two power-series by a determinant , International Journal of Contemporary, Math. Sciences, vol. 6, no. 13-16, pp. 735-744, 2011.
17. M. Esmaeili, M. Gholami, Structured QC LDPC codes with girth 18 and column weight J>=3 , International Journal Electron Communications (AEUE), vol. 64, pp. 202-217, 2010.
18. M. Esmaeili, M. Gholami, Geometrically-structured maximum-girth LDPC block and convolutional codes , IEEE J. on Selected Areas in Communications (J-SAC), vol. 27 , no. 6, pp. 831-845, Aug. 2009.
19. M. Esmaeili, M. Gholami, Type-III LDPC convolutional codes , Contemporary Engineering Sciences, vol. 2, no. 2, pp. 85-93, 2009.
20. M. Esmaeili, M. Gholami, Maximum-girth slope-based quasi-cyclic (2,k>=5)-LDPC codes , IET Communications, vol. 2, no. 10, pp. 1251-1262, Nov. 2008.
Research Journal
21. M Gholami, Z Rahimi, Recursive Construction of (J, L) QC LDPC codes with girth 6 , Transactions on Combinatorics 5 (2), 11-22; 2016
International Conference
22. M Gholami, M Alinia, Efficient encoding of APM-LDPC codes , The 46th Annual Iranian Mathematics Conf., Yazd University, Iran, 62; 2015
23. M. Gholami, M. Samadieh , Double Cylinder Cycle Codes of Arbitrary Girth , The International Congress of Mathematics 2014, August 13-21, 2014, Coex, Seoul, Korea.
24. M. Gholami, M. Alinia, Generalized Greatest Common Divisor Algorithm for Construction of QC LDPC Codes with Girth Eight , The 45th Annual Iranian Mathematics Conference, University of Semnan, Semnan, Iran, August 26-29, 2014.
25. M. Gholami, S. Fasahat , Tight Lower Bound of the Length of (4,L) QC LDPC Codes with Girth Eight , The 45th Annual Iranian Mathematics Conference, University of Semnan, Semnan, Iran, August 26-29, 2014.
26. M. Gholami, M. Samadieh, G. Raeisi, High rate low-density parity-check codes with large girth , The 44th Annual Iranian Mathematics Conference, Ferdowsi University of Mashhad, Iran 27-30 August 2013.
27. M. Gholami, M. Esmaeili, On the girth of structured regular LDPC codes , Wireless Personal Multimedia Communications (WPMC2005), pp. 910-914, Sept. 2005.
National Conference
28. M. Gholami, Z. Rahimi , An Explicit Method to Generate Girth-6 LDPC Codes , The 45th Annual Iranian Mathematics Conference, University of Semnan, Semnan, Iran, August 26-29, 2014.
29. M. Gholami, Constructing LDPC Codes from Edge Coloring Bipartite Graphs , 5th Iranian Conference on Applied Mathematics, Bu-Ali Sina University, Sept. 2-4, 2013.
30. M. Gholami, FSS-based Construction of LDPC Codes , The First Conference on Combinatorics and its Applications Faculty of Khansar, Khansar, Iran, May 18-19, 2012
31. M. Gholami, S. Moradi, Security of Dual-generalized rebalanced-RSA , The First Conference on Combinatorics and its Application, Faculty of Khansar, Khansar, Iran, May 18-19, 2012.
32. M. Gholami, Combinatorial construction of LDPC codes with arbitrary girth , Proc. of the Fourth Conference on Algebraic Combinatorics, Bu-Ali Sina University, Hamedan, Iran, Nov. 2-3, 2011.
33. M. Gholami, Block-structure graph for construction of algebraic LDPC codes , Proc. of the Fourth Conference on Algebraic Combinatorics, Bu-Ali Sina University, Hamedan, Iran, Nov. 2-3, 2011.
٣٤. سمیه مرادی، محمد غلامی, تعمیم سیستم رمزی دوگان RSA به سه گان RSA و بررسی امنیت آن , دومین همایش منطقه ای برق، سما، بروجرد، اسفند 1391



Books



Honors









All rights belong to Shahrekord University