*Dataset for the paper "Entanglement-Assisted Classical Communication Over Quantum Channels for Binary Markov Sources" Mohd Azri Mohd Izhar, Zunaira Babar, Soon Xin Ng and Lajos Hanzo, IEEE Transactions on Vehicular Technology (Accepted). Results may be reproduced using Matlab. Abstract: Abstract—Symbol-based iterative decoding is proposed for the transmission of classical Markov source signals over a quantum channel using a three-stage serial concatenation of a convolu- tional code (CC), a unity-rate code and a two-qubit superdense (SD) protocol. A modified symbol-based maximum a posteriori algorithm is employed for CC decoding to exploit the Markov source statistics during the iterative decoding process. Extrinsic information transfer chart analysis is performed to evaluate the benefit of the extrinsic mutual information gleaned from the CC decoder for sources with different correlations. We evaluate the bit error rate performance of the proposed coding scheme and compare it to the relevant benchmark schemes, including the turbo coding-based SD scheme. We demonstrate that a near- capacity performance can be achieved using the proposed scheme and when utilizing sources having a high correlation coefficient of ρ = 0.9, the proposed coding scheme performs within 0.53 dB from the entanglement-assisted classical capacity. Acknowledgement: This work was supported in part by the Malaysian Ministry of Higher Edu- cation, in part by the Universiti Teknologi Malaysia, in part by the European Research Council through the Advanced Fellow Grant, in part by the Royal Society’s Wolfson Research Merit Award, and in part by the Engineering and Physical Sciences Research Council under Grant EP/L018659/1. * Fig. 2 [Classical information rate against quantum depolarizing probability for a two-qubit SD protocol. For memoryless sources, the effective throughput is 1 cbit/use, which corresponds to q = 0.19.]: Plot using Fig2_J2_cap2.fig. * Fig. 3 [EXIT characteristics of the inner decoder at q = 0.4 and outer decoder for sources with ρ = {0, 0.2, 0.4, 0.6, 0.8, 0.9}. The interleaver length for Π was set to 12, 000 symbols and the memory-4 non-systematic CC with GP (g1 , g2 ) = (25, 21)8 (in octal notation) was employed for DECCC.]: Plot using Fig3_J2_EXIT.fig. * Fig. 4 [EXIT characteristics of the inner decoder at q = 0.325 and various types of non-systematic CCs employed as the outer component of the proposed system for sources with ρ = 0.8. The memory-4 non-systematic CC with GP (25, 21)8 has the best EXIT curve matching with the inner decoder.]: Plot using Fig4_J2_EXIT2.fig. * Fig. 5 [Classical BER performance of the proposed SCUS-BMS scheme when employing the memory-4 non-systematic CC with GP (25, 21)8 as the outer code for sources with ρ = {0, 0.2, 0.4, 0.6, 0.8, 0.9}.]: Plot using Fig5_J2_BER1.fig. * Fig. 6 [Comparison in BER performance at 10−4 between the proposed SCUS-BMS, BCUS-BMS and TC-SD-BMS.]: Plot using Fig6_J2_corrq.fig.