I have done B.Sc in Mathematics(Hons) from West Bengal State University, India in 2013. I have received M.Sc in Pure mathematics degree from University of Calcutta, India in 2016. Now, I am pursing PhD in mathematics, specialized in algebraic coding theory in the department of mathematics, Indian Institute of Technology Patna
RESEARCH INTERESTS
Algebraic Coding Theory, Codes over rings, Quantum error-correcting codes, LCD codes, Weight distribution, Cyclic codes over Matrix rings, Additive cyclic and constacyclic codes.
23
Scopus Publications
787
Scholar Citations
18
Scholar h-index
28
Scholar i10-index
Scopus Publications
Mobility impact on mode selection map in D2D networks-An analytical approach Armin Morattab, Zbigniew Dziong, Kazem Sohraby, Md. Habibul Islam IEEE Wireless Communications and Networking Conference Wcnc, 2016 Device-to-Device (D2D) transmission is a promising technology which enables the User Equipments (UE) in 5G cellular networks to directly communicate without going through the evolved Node-B (eNB). In such networks UEs should select a Transmission Mode (TM) amongst reuse, dedicated, and cellular modes by maximizing the overall transmission throughput or referring to a mode selection map. The selection map identifies the mode which results in the highest data rate given the current state of the network. This paper presents a new analytical framework for the derivation of the selection map of D2D enabled cellular networks. While this problem was treated in the literature through numerical simulations, our approach is analytical and consequently fast and precise.
An optimal MIMO mode selection method for D2D transmission in cellular networks Armin Morattab, Zbigniew Dziong, Kazem Sohraby, Md. Habibul Islam 2015 IEEE 11th International Conference on Wireless and Mobile Computing Networking and Communications Wimob 2015, 2015 Device-to-Device (D2D) communication is one of the new features introduced for Long Term Evolution-Advanced (LTE-A) and beyond networks. In this paper we address the problem of communication mode selection for a pair of User Equipments (UEs). In particular we assume that the paired UEs can choose from the reuse, dedicated, and cellular modes. While this problem was treated in the literature for Single-Input-Single-Output (SISO) case, we derive models for networks where UEs and evolved-Node-Bs (eNBs) exploit Multiple-Input-Multiple-Output (MIMO) techniques with four antennas at each side. This approach requires design of the pre-coding matrices at each node which poses a challenge in the reuse mode due to the non-convexity problem. To solve this issue we propose a distributed iterative algorithm. The numerical study compares the performance of the MIMO based approach with that of the SISO case, and the results show that the presented MIMO based mode selection method provides significantly higher network throughput than that of the SISO based mode selection method for the same D2D transmission range.
Capacity-optimal relay and base station placement in wireless networks Md Habibul Islam, Zbigniew Dziong, Kazem Sohraby, Mahmoud F Daneshmand, Rittwik Jana International Conference on Information Networking, 2012 In this paper, we consider a finite geographic area with multiple mobile stations (MSs) uniformly distributed within the area and multiple candidate locations (CLs) for deploying base stations (BSs) and relay stations (RSs) to serve the MSs. For this network scenario, we study the joint optimal placement of BSs and RSs into those CLs, and MS and RS power allocations such that the sum-capacity of the network is maximized while the target data rate of each MS is achieved. In order to investigate the energy-efficiency trade-offs between deploying BSs and RSs, we provide an iterative algorithm which first maximizes the sum-capacity of the network by optimally deploying a certain number of BSs. Then, the algorithm decreases the number of BSs to be deployed optimally by one and continues deploying RSs until the same sum-rate is achieved. The process continues until the number of optimally deployed BS is 1 and the number of optimally deployed RSs is less than or equal to the total number of candidate RS locations. Our numerical results suggest that significant gains in terms of reduction of total transmitted power can be obtained by replacing BSs with RSs. However, this gain diminishes when the number of BSs became too small which makes the BS-RS and RS-MS distances too large for energy efficient communications.
Joint link scheduling, beamforming and power control for maximizing the sum-rate of cognitive wireless mesh networks Md. Habibul Islam, Zbigniew Dziong IEEE Vehicular Technology Conference, 2011 We consider a time division multiple access (TDMA) based cognitive wireless mesh network (CWMN), where pairs of mesh nodes communicate with each other by sharing a spectrum that is licensed to a primary network with multiple primary users (PUs) who have exclusive right to occupy the spectrum. All the mesh nodes are equipped with multiple antennas capable of beamforming. For such a system, we investigate joint link scheduling, beamforming and power control with the objective of maximizing the sum-rate of CWMN under the minimum data rate requirement constraint of each mesh link (mesh node pair), total transmit power constraint of CWMN in a time slot, and maximum allowable interference constraint of each primary user (PU). The sum-rate maximization subject to the above mentioned constraints gives rise to a non-convex mixed integer nonlinear programming (MINLP) problem which is practically intractable. In order to find an efficient solution of the MINLP, we employ an extended duality based algorithm that uses multiple penalty multipliers to remove the duality gap of the non-convex MINLP problem. Simulation results show that the extended duality based solution performs very close to the optimal solution obtained by exhaustive search algorithm.
Power control and channel allocation in cognitive radio networks with primary users' cooperation Anh Tuan Hoang, Ying-Chang Liang, M.H. Islam IEEE Transactions on Mobile Computing, 2010 We consider a point-to-multipoint cognitive radio network that shares a set of channels with a primary network. Within the cognitive radio network, a base station controls and supports a set of fixed-location wireless subscribers. The objective is to maximize the throughput of the cognitive network while not affecting the performance of primary users. Both downlink and uplink transmission scenarios in the cognitive network are considered. For both scenarios, we propose two-phase mixed distributed/centralized control algorithms that require minimal cooperation between cognitive and primary devices. In the first phase, a distributed power updating process is employed at the cognitive and primary nodes to maximize the coverage of the cognitive network while always maintaining the constrained signal to interference plus noise ratio of primary transmissions. In the second phase, centralized channel assignment is carried out within the cognitive network to maximize its throughput. Numerical results are obtained for the behaviors and performance of our proposed algorithms.
Robust precoding for orthogonal space-time block coded MIMO cognitive radio networks Md Habibul Islam, Ying-Chang Liang, Rui Zhang IEEE Workshop on Signal Processing Advances in Wireless Communications Spawc, 2009 We consider a spectrum sharing based cognitive radio wireless communications system which consists of a secondary transmitter (ST) and a secondary receiver (SR), both equipped with multiple antennas, and a single-antenna primary user (PU). ST is composed of an orthogonal space-time block code (OSTBC) followed by a linear precoder which acts as a multimode beamformer. Given a fixed OSTBC, our goal is to design a robust linear precoder, where the robustness assumes addressing the problem of imperfect channel state information (CSI) of ST to SR (ST-SR) MIMO link at ST. Channel correlation information of ST to PU (ST-PU) link is also available at ST. The imperfect channel knowledge of the ST-SR link is described by a specified uncertainty region, known to ST. The robust precoding design criterion is the maximization of the signal-to-noise ratio (SNR) for the worst-case Frobeneus norm-bounded CSI mismatch subject to the transmit-power constraint of ST and interference-power constraint of PU. The original robust precoder design problem is non-convex and does not have any close-form solution. Using a semidefinite relaxation (SDR) approach, we transform it to a convex form and find the approximate solution using standard numerical methods. Simulation results are presented to show the performance of the robust precoding scheme.
Cognitive space-time processing with known channel correlations: A nonlinear programming approach Md Habibul Islam, Ying-Chang Liang, Zbigniew Dziong IEEE International Symposium on Personal Indoor and Mobile Radio Communications PIMRC, 2009 We consider a spectrum sharing based cognitive radio network where a secondary multiple-input multiple-output (MIMO) communication link coexists with a primary user by opportunistically utilizing the transmit spectrum originally allocated to the primary user (PU). The secondary link employs orthogonal space-time block coding (OSTBC) at the transmitter and maximum likelihood (ML) decoding at the receiver. For this system, we focus on designing linear precoders assuming the knowledge of the transmit antenna fading correlations at the secondary user transmitter (ST) for both the links between PU receiver (PR) and ST (ST-PR), and SU receiver (SR) and ST (ST-SR). Given a limited power budget of ST, the precoder is designed to minimize the minimum-distance average pair-wise error probability (PEP) at SR subject to the average interference-power constraint at PR. The original optimization problem is non-convex and we propose to solve this problem using a nonlinear programming method called the augmented Lagrangian algorithm. Simulation results show that this scheme performs better than previously designed suboptimal schemes at all signal to noise ratio (SNR) levels.
Space-time block coding in MIMO cognitive networks with known channel correlations Proceedings of the 1st European Wireless Technology Conference Euwit 2008, 2008
Spectrum survey in Singapore: Occupancy measurements and analyses Md Habibul Islam, Choo Leng Koh, Ser Wah Oh, Xianming Qing, Yoke Yong Lai, Cavin Wang, Ying-Chang Liang, Bee Eng Toh, Francois Chin, Geok Leng Tan, William Toh Proceedings of the 3rd International Conference on Cognitive Radio Oriented Wireless Networks and Communications Crowncom 2008, 2008 We study the 24-hour spectrum usage pattern in Singapore in the frequency bands ranging from 80 MHz to 5850 MHz. The objectives are to find how the scarce radio spectrum allocated to different services is utilized in Singapore and identify the bands that could be accessed for future opportunistic use due to their low or no active utilization. The results from the spectrum measurements taken over 12 weekday periods reveal that a significant amount of spectrum in Singapore has very low occupancy all the time. The occupancy is quantified as the amount of spectrum detected above a certain received power threshold. The outcome of this study suggests that Singapore has a great potential for employing emerging spectrum sharing technology such as the cognitive radio technology to accommodate enormous demands for future wireless services. However, this study of spectrum survey is preliminary in its nature and future long term studies need to be performed to determine any potential secondary usage on those channels that have low or no active utilization.
Combining eigen-beamforming and orthogonal space-time block coding for secondary usage of spectrum M. H. Islam, Y.-C. Liang, A. T. Hoang IEEE International Conference on Communications, 2008 For a spectrum sharing environment, where an unlicensed (secondary) user coexists with a licensed (primary) user, we study the performance of the multiantenna transmission scheme that combines orthogonal space-time block coding with transmit eigen-beamforming. The objective is to minimize a tight bound on the symbol error rate of the secondary user subject to two practical constraints: maximum transmit power constraint of the secondary user and received interference constraint of the primary user. Here, we consider both peak and average interference constraints. Using the knowledge of channel correlations of the secondary user and perfect channel knowledge (for the peak interference constraint) or the knowledge of channel correlations (for the average interference constraint) of the primary user, we solve the original optimization problem with two constraints by decomposing it into two sub- problems each with a single constraint. Simulation results are presented to show the symbol error rate performance of the secondary user under different channel and interference constraint considerations.
Galois hulls of constacyclic codes over affine algebra rings I Debnath, H Islam, E Martínez-Moro, O Prakash Discrete Mathematics 349 (2), 114750 , 2026 2026 Citations: 1
Dihedral quantum codes N Willenborg, M Borello, AL Horlemann, H Islam Journal of Algebra and Its Applications 24 (13n14), 2541028 , 2025 2025 Citations: 2
Quantum codes from skew cyclic codes over mixed alphabets: O. Prakash et al. O Prakash, S Patel, H Islam Computational and Applied Mathematics 44 (8), 384 , 2025 2025 Citations: 3
Study of small Galois hull dimensions of constacyclic codes I Debnath, H Islam, S Yadav, O Prakash Advances in Mathematics of Communications 22 (2026), 1-18 , 2025 2025
Hermitian hull of constacyclic codes over a class of non-chain rings and new quantum codes S Yadav, A Singh, H Islam, O Prakash, P Solé Computational & Applied Mathematics , 2024 2024 Citations: 6
Encoding and Construction of Quantum Codes from -cyclic Codes over a Class of Non-chain Rings O Prakash, S Patel, H Islam arXiv preprint arXiv:2404.01904 , 2024 2024
Additive conjucyclic codes over a class of Galois rings H Islam, DK Bhunia Journal of Applied Mathematics and Computing 70 (1), 235-250 , 2024 2024 Citations: 1
Algebraic structure of cyclic codes over M3 (Fp) H Islam, O Prakash, DK Bhunia J. Discret. Math. Sci. Cryptogr 27, 189-201 , 2024 2024 Citations: 2
Construction of quantum codes from (γ, Δ)-cyclic codes. O Prakash, S Patel, H Islam CoRR , 2024 2024
New quantum codes from skew constacyclic codes RK Verma, O Prakash, A Singh, H Islam Advances in Mathematics of Communications 17 (4), 900-919 , 2023 2023 Citations: 26
-skew cyclic codes and their application to quantum codes O Prakash, S Patel, H Islam arXiv preprint arXiv:2305.10404 , 2023 2023
Galois hulls of constacyclic codes over finite fields I Debnath, O Prakash, H Islam Cryptography and Communications 15 (1), 111-127 , 2023 2023 Citations: 14
Structure of skew cyclic codes over []/ k p u H Islam, O Prakash 2023 Citations: 4
On the structure of cyclic codes over M-2 (Fp+ uF (p))(Jun, 10.1007/s13226-021-00014-x, 2021) H Islam, O Prakash, DK Bhunia INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS 53 (4), 1128-1128 , 2022 2022
Erratum to: On the structure of cyclic codes over M2 (Fp+ u Fp) H Islam, O Prakash, DK Bhunia Indian Journal of Pure and Applied Mathematics 53 (4), 1128-1128 , 2022 2022
Galois hull dimensions of Gabidulin codes H Islam, AL Horlemann arXiv preprint arXiv:2211.05068 , 2022 2022 Citations: 11
Cyclic codes over M 4 (F 2 + u F 2 ) (Mar, 10.1007/s12095-022-00572-9, 2022) S Patel, O Prakash, H Islam CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND … , 2022 2022
Cyclic codes over S Patel, O Prakash, H Islam Cryptography and Communications 14 (5), 1021-1034 , 2022 2022 Citations: 11
Construction of reversible cyclic codes over ℤ p k H Islam, O Prakash Journal of Discrete Mathematical Sciences and Cryptography 25 (6), 1817-1830 , 2022 2022 Citations: 13
A family of constacyclic codes over a class of non-chain rings and new quantum codes H Islam, S Patel, O Prakash, P Solé Journal of Applied Mathematics and Computing 68 (4), 2493-2514 , 2022 2022 Citations: 15
MOST CITED SCHOLAR PUBLICATIONS
Quantum codes from the cyclic codes over F p [u, v, w]/⟨ u 2-1, v 2-1, w 2-1, uv-vu, vw-wv, wu-uw⟩ H Islam, O Prakash Journal of Applied Mathematics and Computing 60 (1), 625-635 , 2019 2019 Citations: 63
New quantum codes from constacyclic and additive constacyclic codes H Islam, O Prakash Quantum Information Processing 19 (9), 319 , 2020 2020 Citations: 52
New quantum codes from constacyclic codes over the ring H Islam, O Prakash, RK Verma Advances in Mathematics of Communications 16 (1), 17-35 , 2022 2022 Citations: 34
Construction of LCD and new quantum codes from cyclic codes over a finite non-chain ring H Islam, O Prakash Cryptography and Communications 14 (1), 59-73 , 2022 2022 Citations: 34
New quantum codes from constacyclic codes over a non-chain ring A Alahmadi, H Islam, O Prakash, P Solé, A Alkenani, N Muthana, R Hijazi Quantum Information Processing 20 (2), 60 , 2021 2021 Citations: 34
Quantum codes from the cyclic codes over Fp [v, w]/〈 v2− 1, w2− 1, vw− wv〉 H Islam, O Prakash, RK Verma Springer Proc. Math. Stat 307, 67-74 , 2020 2020 Citations: 30
Skew cyclic and skew ( α 1 + uα 2 + vα 3 + uvα 4 )-constacyclic codes over F q + uF q + vF q + uvF q H Islam, O Prakash International Journal of Information and Coding Theory 5 (2), 101-116 , 2018 2018 Citations: 30
A study of cyclic and constacyclic codes over Z 4 + u Z 4 + v Z 4 H Islam, O Prakash International Journal of Information and Coding Theory 5 (2), 155-168 , 2018 2018 Citations: 30
A class of constacyclic codes over H Islam, T Bag, O Prakash Journal of Applied Mathematics and Computing 60 (1), 237-251 , 2019 2019 Citations: 27
New quantum codes from skew constacyclic codes RK Verma, O Prakash, A Singh, H Islam Advances in Mathematics of Communications 17 (4), 900-919 , 2023 2023 Citations: 26
A Class of Constacyclic Codes over the Ring ℤ₄ [u, v]/〈 u ², v ², uv–vu〉 and Their Gray Images H Islam, O Prakash Filomat 33 (8), 2237-2248 , 2019 2019 Citations: 26
Self-dual and LCD double circulant and double negacirculant codes over S Yadav, H Islam, O Prakash, P Solé Journal of Applied Mathematics and Computing 67 (1), 689-705 , 2021 2021 Citations: 25
New Quantum Codes from Skew Constacyclic Codes Over a Class Of Non-Chain Rings R e , q O Prakash, H Islam, S Patel, P Solé International Journal of Theoretical Physics 60 (9), 3334-3352 , 2021 2021 Citations: 25
Quantum codes obtained from constacyclic codes H Islam, O Prakash, DK Bhunia International Journal of Theoretical Physics 58 (11), 3945-3951 , 2019 2019 Citations: 23
Self-dual and LCD double circulant codes over a class of non-local rings O Prakash, S Yadav, H Islam, P Solé Computational & Applied Mathematics , 2022 2022 Citations: 22
Cyclic codes over a non-chain ring Re, q and their application to LCD codes H Islam, E Martínez-Moro, O Prakash Discrete Mathematics 344 (10), 112545 , 2021 2021 Citations: 21
New quantum and LCD codes over finite fields of even characteristic H Islam, O Prakash Defence Science Journal 71 (5), 656-661 , 2021 2021 Citations: 21
A note on skew constacyclic codes over H Islam, O Prakash Discrete Mathematics, Algorithms and Applications 11 (03), 1950030 , 2019 2019 Citations: 19
A family of constacyclic codes over Fpm [v, w]/〈 v2− 1, w2− 1, vw− wv〉 H Islam, RK Verma, O Prakash Int. J. Inf. Coding Theory 5 (3-4), 198-210 , 2020 2020 Citations: 18
Z 4 Z 4 [u]-additive cyclic and constacyclic codes H Islam, O Prakash, P Solé Advances in Mathematics of Communications , 2020 2020 Citations: 17
