{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:36:42Z","timestamp":1764175002133,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T00:00:00Z","timestamp":1619136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006730","name":"Ministry of Education and Research, Romania","doi-asserted-by":"publisher","award":["PN-III-P1-1.1-PD-2019-0285"],"award-info":[{"award-number":["PN-III-P1-1.1-PD-2019-0285"]}],"id":[{"id":"10.13039\/501100006730","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Monomial codes were recently equipped with partial order relations, a fact that allowed researchers to discover structural properties and efficient algorithm for constructing polar codes. Here, we refine the existing order relations in the particular case of the binary erasure channel. The new order relation takes us closer to the ultimate order relation induced by the pointwise evaluation of the Bhattacharyya parameter of the synthetic channels, which is still a partial order relation. To overcome this issue, we appeal to a related technique from network theory. Reliability network theory was recently used in the context of polar coding and more generally in connection with decreasing monomial codes. In this article, we investigate how the concept of average reliability is applied for polar codes designed for the binary erasure channel. Instead of minimizing the error probability of the synthetic channels, for a particular value of the erasure parameter p, our codes minimize the average error probability of the synthetic channels. By means of basic network theory results, we determine a closed formula for the average reliability of a particular synthetic channel, that recently gain the attention of researchers.<\/jats:p>","DOI":"10.3390\/s21092976","type":"journal-article","created":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T02:12:57Z","timestamp":1619316777000},"page":"2976","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Bhattacharyya Parameter of Monomial Codes for the Binary Erasure Channel: From Pointwise to Average Reliability"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-9097","authenticated-orcid":false,"given":"Vlad-Florin","family":"Dr\u0103goi","sequence":"first","affiliation":[{"name":"Faculty of Exact Sciences, Aurel Vlaicu University of Arad, 2 Elena Dragoi Street, 310130 Arad, Romania"},{"name":"LITIS, University of Rouen Normandie, Avenue de l\u2019Universit\u00e9, 76801 Saint-Etienne-du-Rouvray, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1664-9627","authenticated-orcid":false,"given":"Gabriela","family":"Cristescu","sequence":"additional","affiliation":[{"name":"Faculty of Exact Sciences, Aurel Vlaicu University of Arad, 2 Elena Dragoi Street, 310130 Arad, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,4,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/COMST.2020.2967127","article-title":"Design of Polar Codes in 5G New Radio","volume":"23","author":"Bioglio","year":"2020","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_3","unstructured":"Dragoi, V. (2017). Algebraic Approach for the Study of Algorithmic Problems Coming from Cryptography and the Theory of Error Correcting Codes. [Ph.D. Thesis, Universit\u00e9 de Rouen]."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bardet, M., Dragoi, V., Otmani, A., and Tillich, J. (2016, January 10\u201315). Algebraic properties of polar codes from a new polynomial formalism. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Rengaswamy, N., Calderbank, R., Newman, M., and Pfister, H.D. (2020, January 21\u201326). Classical Coding Problem from Transversal T Gates, 2020. Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9174408"},{"key":"ref_6","unstructured":"Rengaswamy, N. (2020). Classical Coding Approaches to Quantum Applications. arXiv."},{"key":"ref_7","unstructured":"Krishna, A., and Tillich, J.P. (2019). Magic state distillation with punctured polar codes. arXiv."},{"key":"ref_8","first-page":"118","article-title":"Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes","volume":"Volume 9606","author":"Bardet","year":"2016","journal-title":"Post-Quantum Cryptography, PQCrypto 2016"},{"key":"ref_9","first-page":"376","article-title":"Vulnerabilities of the McEliece Variants Based on Polar Codes","volume":"Volume 11359","author":"Beiu","year":"2018","journal-title":"Innovative Security Solutions for Information Technology and Communications, SecITC 2018"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Bucerzan, D., Dragoi, V., and Kalachi, H.T. Evolution of the McEliece Public Key Encryption Scheme. Innovative Security Solutions for Information Technology and Communications, SecITC 2017, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-319-69284-5_10"},{"key":"ref_11","unstructured":"Dr\u0103goi, V.F., and Beiu, V. (2019). Fast Reliability Ranking of Matchstick Minimal Networks. arXiv."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Dragoi, V., Cowell, S., and Beiu, V. (2018, January 23\u201326). Ordering series and parallel compositions. Proceedings of the 2018 IEEE 18th International Conference on Nanotechnology (IEEE-NANO), Cork, Ireland.","DOI":"10.1109\/NANO.2018.8626408"},{"key":"ref_13","first-page":"115","article-title":"On Posets for Reliability: How Fine Can They Be?","volume":"Volume 1221","author":"Beiu","year":"2021","journal-title":"Soft Computing Applications SOFA 2018, Advances in Intelligent Systems and Computing"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Mondelli, M., Hassani, S.H., and Urbanke, R. (2017, January 25\u201330). Construction of polar codes with sublinear complexity. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006850"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"He, G., Belfiore, J., Land, I., Yang, G., Liu, X., Chen, Y., Li, R., Wang, J., Ge, Y., and Zhang, R. (2017, January 4\u20138). Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes. Proceedings of the GLOBECOM 2017-2017 IEEE Global Communications Conference, Singapore.","DOI":"10.1109\/GLOCOM.2017.8254146"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","article-title":"How to Construct Polar Codes","volume":"59","author":"Tal","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Mori, R., and Tanaka, T. (July, January 28). Performance and construction of polar codes on symmetric binary-input memoryless channels. Proceedings of the 2009 IEEE International Symposium on information theory, Seoul, Korea.","DOI":"10.1109\/ISIT.2009.5205857"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Mahdavifar, H., El-Khamy, M., Lee, J., and Kang, I. (2013, January 7\u201312). On the construction and decoding of concatenated polar codes. Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620367"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"6253","DOI":"10.1109\/TIT.2010.2080990","article-title":"Polar Codes: Characterization of Exponent, Bounds, and Constructions","volume":"56","author":"Korada","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1109\/LCOMM.2015.2450213","article-title":"On the Channel-Specific Construction of Polar Codes","volume":"19","year":"2015","journal-title":"IEEE Commun. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Trifonov, P., and Trofimiuk, G. (2017, January 25\u201330). A randomized construction of polar subcodes. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006852"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/TCOMM.2019.2951403","article-title":"AI Coding: Learning to Construct Error Correction Codes","volume":"68","author":"Huang","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/TWC.2013.113013.130884","article-title":"Minimum-Variance Importance-Sampling Bernoulli Estimator for Fast Simulation of Linear Block Codes over Binary Symmetric Channels","volume":"13","author":"Romano","year":"2014","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3101","DOI":"10.1109\/TCOMM.2019.2895829","article-title":"Quasi-Analytical Simulation Method for Estimating the Error Probability of Star Domain Decoders","volume":"67","author":"Minja","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"7114","DOI":"10.1109\/TIT.2019.2930292","article-title":"Generalized Partial Orders for Polar Code Bit-Channels","volume":"65","author":"Wu","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1954","DOI":"10.1109\/TIT.2017.2671410","article-title":"Efficiently Decoding Reed\u2013Muller Codes From Random Errors","volume":"63","author":"Saptharishi","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"4298","DOI":"10.1109\/TIT.2017.2673829","article-title":"Reed-Muller Codes Achieve Capacity on Erasure Channels","volume":"63","author":"Kudekar","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Kumar, S., Calderbank, R., and Pfister, H.D. (2016, January 11\u201314). Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels. Proceedings of the 2016 IEEE Information Theory Workshop (ITW), Cambridge, UK.","DOI":"10.1109\/ITW.2016.7606832"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"6044","DOI":"10.1109\/TIT.2019.2920140","article-title":"On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels","volume":"65","author":"Ordentlich","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/LCOMM.2019.2947910","article-title":"Studying the Binary Erasure Polarization Subchannels Using Network Reliability","volume":"24","author":"Beiu","year":"2020","journal-title":"IEEE Commun. Lett."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Stanley, R.P. (2012). Enumerative Combinatorics, Cambridge University Press.","DOI":"10.1017\/CBO9781139058520"},{"key":"ref_32","first-page":"77","article-title":"Cubic Spline Approximation of the Reliability Polynomials of Two Dual Hammock Networks","volume":"11","author":"Cristescu","year":"2019","journal-title":"Transylv. J. Math. Mech."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Cristescu, G., and Dr\u0103goi, V.F. (2021). Efficient approximation of two-terminal networks reliability polynomials using cubic splines. IEEE Trans. Reliab., 1\u201311.","DOI":"10.1109\/TR.2021.3049957"},{"key":"ref_34","unstructured":"Mondelli, M. (2016). From Polar to Reed-Muller Codes: Unified Scaling, Non-standard Channels, and a Proven Conjecture. [Ph.D. Thesis, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne]."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Richardson, T., and Urbanke, R. (2008). Modern Coding Theory, Cambridge University Press.","DOI":"10.1017\/CBO9780511791338"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Roth, R.M. (2006). Introduction to Coding Theory, Cambridge University Press.","DOI":"10.1017\/CBO9780511808968"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Carlet, C. (2010). Boolean functions for cryptography and error correcting codes. Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Cambridge University Press. Chapter 8.","DOI":"10.1017\/CBO9780511780448.011"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","article-title":"Reliable circuits using less reliable relays - Part I","volume":"262","author":"Moore","year":"1956","journal-title":"J. Frankl. Inst."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"772","DOI":"10.15837\/ijccc.2018.5.3354","article-title":"How Reliable are Compositions of Series and Parallel Networks Compared with Hammocks?","volume":"13","author":"Cowell","year":"2018","journal-title":"Int. J. Comput. Commun. Control"},{"key":"ref_40","unstructured":"Colbourn, C.J. (1987). The Combinatorics of Network Reliability, Oxford University Press."},{"key":"ref_41","first-page":"93","article-title":"The shape of the reliability polynomial of a hammock network","volume":"Volume 1243","author":"Jianu","year":"2021","journal-title":"Intelligent Methods in Computing, Communication and Control. ICCC 2020, Advances in Intelligent Systems and Computing"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.dam.2014.05.048","article-title":"The average reliability of a graph","volume":"177","author":"Brown","year":"2014","journal-title":"Discret. Appl. Math."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/21\/9\/2976\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:52:08Z","timestamp":1760161928000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/21\/9\/2976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,23]]},"references-count":42,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["s21092976"],"URL":"https:\/\/doi.org\/10.3390\/s21092976","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2021,4,23]]}}}