51 citations · 92 across the 2 of their papers we have counts for
6 papers
Polar Codes and Their Quantum-Domain Counterparts
Zunaira Babar, Zeynep B. Kaykac Egilmez, Luping Xiang +4
Arikan's polar codes are capable of achieving the Shannon's capacity at a low encoding and decoding complexity, while inherently supporting rate adaptation. By virtue of these attr…
Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes
Daryus Chandra, Zunaira Babar, Soon Xin Ng +1
Quantum stabilizer codes (QSCs) suffer from a low quantum coding rate, since they have to recover the quantum bits (qubits) in the face of both bit-flip and phase-flip errors. In t…
Quantum-aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming
Dimitrios Alanis, Panagiotis Botsinis, Zunaira Babar +4
Pareto optimality is capable of striking the optimal trade-off amongst the diverse conflicting QoS requirements of routing in wireless multihop networks. However, this comes at the…
A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks
D. Alanis, P. Botsinis, Z. Babar +4
Wireless Multihop Networks (WMHNs) have to strike a trade-off among diverse and often conflicting Quality-of-Service (QoS) requirements. The resultant solutions may be included by…
The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
Zunaira Babar, Panagiotis Botsinis, Dimitrios Alanis +2
Powerful Quantum Error Correction Codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classi…
EXIT-Chart Aided Near-Capacity Quantum Turbo Code Design
Zunaira Babar, Soon Xin Ng, Lajos Hanzo
The design of Quantum Turbo Codes (QTCs) typically relies on the analysis of their distance spectra, followed by Monte-Carlo simulations. By contrast, in this paper we appropriatel…