{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T14:33:57Z","timestamp":1769006037769,"version":"3.49.0"},"reference-count":20,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad, Gobierno de Espa\u00f1a","doi-asserted-by":"publisher","award":["TEC2016-75067-C4-3-R"],"award-info":[{"award-number":["TEC2016-75067-C4-3-R"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Quantum turbo codes (QTC) have shown excellent error correction capabilities in the setting of quantum communication, achieving a performance less than 1 dB away from their corresponding hashing bounds. Existing QTCs have been constructed using uniform random interleavers. However, interleaver design plays an important role in the optimization of classical turbo codes. Consequently, inspired by the widely used classical-to-quantum isomorphism, this paper studies the integration of classical interleaving design methods into the paradigm of quantum turbo coding. Simulations results demonstrate that error floors in QTCs can be lowered significantly, while decreasing memory consumption, by proper interleaving design without increasing the overall decoding complexity of the system.<\/jats:p>","DOI":"10.3390\/e21070633","type":"journal-article","created":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T11:26:18Z","timestamp":1561634778000},"page":"633","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["On the Performance of Interleavers for Quantum Turbo Codes"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7058-8426","authenticated-orcid":false,"given":"Josu","family":"Etxezarreta Martinez","sequence":"first","affiliation":[{"name":"Department of Basic Science, Tecnun-University of Navarra, 20018 San Sebastian, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro M.","family":"Crespo","sequence":"additional","affiliation":[{"name":"Department of Basic Science, Tecnun-University of Navarra, 20018 San Sebastian, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Garcia-Fr\u00edas","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Delaware, Newark, DE 19716, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,6,27]]},"reference":[{"key":"ref_1","unstructured":"Berrou, C., Glavieux, A., and Thitimajshima, P. (1993, January 23\u201326). Near Shannon limit error-correcting coding and decoding: Turbo-codes. Proceedings of the IEEE International Conference on Communications (ICC \u201993), Geneva, Switzerland."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2776","DOI":"10.1109\/TIT.2009.2018339","article-title":"Quantum Serial Turbo Codes","volume":"55","author":"Poulin","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1109\/COMST.2018.2861361","article-title":"Duality of Quantum and Classical Error Correction Codes: Design Principles amp; Examples","volume":"21","author":"Babar","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1126\/science.1131563","article-title":"Correcting Quantum Errors with Entanglement","volume":"314","author":"Brun","year":"2006","journal-title":"Science"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TIT.2013.2292052","article-title":"Entanglement-Assisted Quantum Turbo Codes","volume":"60","author":"Wilde","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/TVT.2014.2328638","article-title":"EXIT-Chart-Aided Near-Capacity Quantum Turbo Code Design","volume":"64","author":"Babar","year":"2015","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/ACCESS.2015.2405533","article-title":"The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure","volume":"3","author":"Babar","year":"2015","journal-title":"IEEE Access"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"10194","DOI":"10.1109\/ACCESS.2016.2591910","article-title":"EXIT-Chart Aided Quantum Code Design Improves the Normalised Throughput of Realistic Quantum Devices","volume":"4","author":"Nguyen","year":"2016","journal-title":"IEEE Access"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1916","DOI":"10.1109\/LCOMM.2016.2593874","article-title":"Serially Concatenated Unity-Rate Codes Improve Quantum Codes Without Coding-Rate Reduction","volume":"20","author":"Babar","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s11277-007-9439-0","article-title":"A Low Complexity Algorithm for Generating Turbo Code s-Random Interleavers","volume":"46","author":"Koutsouvelis","year":"2008","journal-title":"Wirel. Pers. Commun."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Saul, L.S., and Francisco, G. (2011, January 12\u201314). A comparative study for turbo code interleavers designed for short frame size and relatively high SNR channel. Proceedings of the 2011 5th International Conference on Signal Processing and Communication Systems (ICSPCS), Honolulu, HI, USA.","DOI":"10.1109\/ICSPCS.2011.6140837"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1109\/49.924867","article-title":"Interleaver design for turbo codes","volume":"19","author":"Sadjadpour","year":"2001","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_14","unstructured":"Andrews, K.S., Heegard, C., and Kozen, D. (1998, January 16\u201321). Interleaver design methods for turbo codes. Proceedings of the 1998 IEEE International Symposium on Information Theory, Cambridge, MA, USA."},{"key":"ref_15","unstructured":"Kovaci, M., Balta, H.G., and Nafornita, M.M. (2005, January 14\u201315). The performances of interleavers used in turbo codes. Proceedings of the 2005 International Symposium on Signals, Circuits and Systems, Iasi, Romania."},{"key":"ref_16","unstructured":"Vafi, S., and Wysocki, T. (2005, January 2\u20134). Performance of convolutional interleavers with different spacing parameters in turbo codes. Proceedings of the 2005 Australian Communications Theory Workshop, Brisbane, Australia."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Heegard, C., and Wicker, S.B. (1999). Turbo Coding, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-2999-3"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/LCOMM.2004.832737","article-title":"Design of flexible-length S-random interleaver for turbo codes","volume":"8","author":"Popovski","year":"2004","journal-title":"IEEE Commun. Lett."},{"key":"ref_19","unstructured":"Consultative Committee for Space Data Systems (CCSDS) (2019, May 13). Telemetry Channel Coding. Available online: https:\/\/public.ccsds.org\/Pubs\/101x0b6s.pdf."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/JSAC.1984.1146031","article-title":"Techniques for Estimating the Bit Error Rate in the Simulation of Digital Communication Systems","volume":"2","author":"Jeruchim","year":"1984","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/7\/633\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:01:36Z","timestamp":1760187696000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/7\/633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,27]]},"references-count":20,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2019,7]]}},"alternative-id":["e21070633"],"URL":"https:\/\/doi.org\/10.3390\/e21070633","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,27]]}}}