{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:24:31Z","timestamp":1742945071129,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030519919"},{"type":"electronic","value":"9783030519926"}],"license":[{"start":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T00:00:00Z","timestamp":1597449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T00:00:00Z","timestamp":1597449600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-51992-6_10","type":"book-chapter","created":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T16:04:03Z","timestamp":1597421043000},"page":"115-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Posets for Reliability: How Fine Can They Be?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8185-956X","authenticated-orcid":false,"given":"Valeriu","family":"Beiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6093-9755","authenticated-orcid":false,"given":"Simon R.","family":"Cowell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-9097","authenticated-orcid":false,"given":"Vlad-Florin","family":"Dr\u0103goi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,15]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0269964800143074","volume":"14","author":"Y Ath","year":"2000","unstructured":"Ath, Y., Sobel, M.: Some conjectured uniformly optimal reliable networks. Prob. Eng. Inf. Sci. 14(3), 375\u2013383 (2000)","journal-title":"Prob. Eng. Inf. Sci."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ball, M.O., Colbourn, C.J., Provan, J.S.: Network reliability. In: Handbook of Operations Research: Network Models, Chap. 11, pp. 673\u2013762. Elsevier, Amsterdam (1995)","DOI":"10.1016\/S0927-0507(05)80128-8"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bardet, M., Chaulet, J., Dr\u0103goi, V., Otmani, A., Tillich, J.P.: Cryptanalysis of the McEliece public key cryptosystem based on polar codes. In: Proceedings of International Workshop on Post-Quantum Cryptography (PQCrypto), Fukuoka, Japan, pp. 118\u2013143 (2016)","DOI":"10.1007\/978-3-319-29360-8_9"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bardet, M., Dr\u0103goi, V., Otmani, A., Tillich, J.P.: Algebraic properties of polar codes from a new polynomial formalism. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain, pp. 230\u2013234 (2016)","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Beiu, V., D\u0103u\u015f, L.: Deciphering the reliability scheme of the neurons one ion channel at a time. In: Proceedings of International Conference on Bioinspired Information and Communications Technologies (BICT), Boston, MA, pp. 182\u2013187 (2014)","DOI":"10.4108\/icst.bict.2014.257905"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1002\/net.21811","volume":"72","author":"H Bertrand","year":"2017","unstructured":"Bertrand, H., Goff, O., Graves, C., Sun, M.: On uniformly most reliable two-terminal graphs. Networks 72(2), 200\u2013216 (2017)","journal-title":"Networks"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230210204","volume":"21","author":"FT Boesch","year":"1991","unstructured":"Boesch, F.T., Li, X., Suffel, C.: On the existence of uniformly optimally reliable networks. Networks 21(2), 181\u2013194 (1991)","journal-title":"Networks"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1002\/net.21530","volume":"63","author":"JI Brown","year":"2014","unstructured":"Brown, J.I., Cox, D.: Nonexistence of optimal graphs for all terminal reliability. Networks 63(2), 146\u2013153 (2014)","journal-title":"Networks"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9947-1971-0288039-7","volume":"154","author":"TH Brylawski","year":"1971","unstructured":"Brylawski, T.H.: A combinatorial model for series-parallel networks. Trans. Am. Math. Soc. 154, 1\u201322 (1971)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1215\/S0012-7094-56-02340-7","volume":"23","author":"L Carlitz","year":"1956","unstructured":"Carlitz, L., Riordan, J.: The number of labeled two-terminal series-parallel networks. Duke Math. J. 23(3), 435\u2013445 (1956)","journal-title":"Duke Math. J."},{"key":"10_CR11","volume-title":"The Combinatorics of Network Reliability","author":"CJ Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/TR.2015.2417527","volume":"64","author":"L D\u0103u\u015f","year":"2015","unstructured":"D\u0103u\u015f, L., Beiu, V.: Lower and upper reliability bounds for consecutive-$$k $$-out-of-$$ n $$:$${F}$$ systems. IEEE Trans. Reliab. 64(3), 1128\u20131135 (2015)","journal-title":"IEEE Trans. Reliab."},{"issue":"1\u20133","key":"10_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.dam.2003.06.003","volume":"140","author":"H Deng","year":"2004","unstructured":"Deng, H., Chen, J., Li, Q., Li, R., Gao, Q.: On the construction of most reliable networks. Discrete Appl. Math. 140(1\u20133), 19\u201333 (2004)","journal-title":"Discrete Appl. Math."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Dr\u0103goi, V., Cowell, S.R., Beiu, V.: Ordering series and parallel compositions. In: Proceedings of IEEE International Conference on Nanotechnology (IEEE-NANO), Cork, Ireland, pp. 1\u20134 (2018)","DOI":"10.1109\/NANO.2018.8626408"},{"issue":"5","key":"10_CR15","doi-asserted-by":"publisher","first-page":"772","DOI":"10.15837\/ijccc.2018.5.3354","volume":"13","author":"V Dr\u0103goi","year":"2018","unstructured":"Dr\u0103goi, V., Cowell, S.R., Beiu, V., Hoar\u0103, S., Ga\u015fpar, P.: How reliable are compositions of series and parallel networks compared with hammocks? Int. J. Comput. Commun. Control 13(5), 772\u2013791 (2018)","journal-title":"Int. J. Comput. Commun. Control"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Dr\u0103goi, V., Cowell, S.R., Hoar\u0103, S., Ga\u015fpar, P., Beiu, V.: Can series and parallel compositions improve on hammocks? In: Proceedings of International Conference on Computers Communications and Control (ICCCC), Oradea, Romania, pp. 124\u2013130 (2018)","DOI":"10.1109\/ICCCC.2018.8390448"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"10_CR18","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1109\/TIT.2009.2039037","volume":"56","author":"DM Gordon","year":"2010","unstructured":"Gordon, D.M., Miller, V.S., Ostapenko, P.: Optimal hash functions for approximate matches on the $$n$$-cube. IEEE Trans. Inf. Theory 56(3), 984\u2013991 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"He, G., Belfiore, J., Land, I., Yang, G., Liu, X., Chen, Y., Li, R., Wang, J., Ge, Y., Zhang, R., Tong, W.: $$\\beta $$-expansion: A theoretical framework for fast and recursive construction of polar codes. In: Proceedings of IEEE Global Communications Conference (GLOBECOM), Singapore, Singapore, art. 8254146, pp. 1\u20136 (2017)","DOI":"10.1109\/GLOCOM.2017.8254146"},{"issue":"5","key":"10_CR20","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/TR.1980.5220921","volume":"R\u201329","author":"JM Kontoleon","year":"1980","unstructured":"Kontoleon, J.M.: Reliability determination of a $$r $$-successive-out-of-$$ n $$:$${f}$$ system. IEEE Trans. Reliab. R\u201329(5), 437\u2013437 (1980)","journal-title":"IEEE Trans. Reliab."},{"issue":"6","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1002\/j.1538-7305.1955.tb03799.x","volume":"34","author":"CY Lee","year":"1955","unstructured":"Lee, C.Y.: Analysis of switching networks. Bell Syst. Tech. J. 34(6), 1287\u20131315 (1955)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/1425808","volume":"4","author":"ZA Lomnicki","year":"1972","unstructured":"Lomnicki, Z.A.: Two-terminal series-parallel networks. Adv. Appl. Prob. 4(1), 109\u2013150 (1972)","journal-title":"Adv. Appl. Prob."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"de Moivre, A.: The Doctrine of Chances, 1st ed., London (1718)","DOI":"10.4324\/9780203041352-1"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Mondelli, M., Hassani, S.H., Urbanke, R.: Construction of polar codes with sublinear complexity. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, pp. 1853\u20131857 (2017)","DOI":"10.1109\/ISIT.2017.8006850"},{"issue":"3","key":"10_CR25","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","volume":"262","author":"EF Moore","year":"1956","unstructured":"Moore, E.F., Shannon, C.E.: Reliable circuits using less reliable relays - Part I. J. Franklin Inst. 262(3), 191\u2013208 (1956)","journal-title":"J. Franklin Inst."},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0016-0032(56)90044-8","volume":"262","author":"EF Moore","year":"1956","unstructured":"Moore, E.F., Shannon, C.E.: Reliable circuits using less reliable relays - Part II. J. Franklin Inst. 262(4), 281\u2013297 (1956)","journal-title":"J. Franklin Inst."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Mori, R., Tanaka, T.: Performance and construction of polar codes on symmetric binary-input memoryless channels. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Seoul, South Korea, pp. 1496\u20131500 (2009)","DOI":"10.1109\/ISIT.2009.5205857"},{"issue":"4","key":"10_CR28","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1002\/net.3230210404","volume":"21","author":"W Myrvold","year":"1991","unstructured":"Myrvold, W., Cheung, K.H., Page, L.B., Perry, J.E.: Uniformly-most reliable networks do not always exist. Networks 21(4), 417\u2013419 (1991)","journal-title":"Networks"},{"issue":"1\u20134","key":"10_CR29","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/sapm194221183","volume":"21","author":"J Riordan","year":"1942","unstructured":"Riordan, J., Shannon, C.E.: The number of two-terminal series-parallel networks. J. Math. Phys. 21(1\u20134), 83\u201393 (1942)","journal-title":"J. Math. Phys."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrch, C.: A partial order for the synthesized channels of a polar code. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain, pp. 220\u2013224 (2016)","DOI":"10.1109\/ISIT.2016.7541293"},{"key":"10_CR31","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"2012","unstructured":"Stanley, R.P.: Enumerative Combinatorics. Cambridge University Press, Cambridge (2012)"},{"issue":"3","key":"10_CR32","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"10_CR33","first-page":"43","volume":"34","author":"J von Neumann","year":"1956","unstructured":"von Neumann, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. Automata Stud. 34, 43\u201398 (1956)","journal-title":"Automata Stud."},{"issue":"5","key":"10_CR34","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230240504","volume":"24","author":"G Wang","year":"1994","unstructured":"Wang, G.: A proof of Boesch\u2019s conjecture. Networks 24(5), 277\u2013284 (1994)","journal-title":"Networks"}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51992-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T03:58:27Z","timestamp":1597463907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51992-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,15]]},"ISBN":["9783030519919","9783030519926"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51992-6_10","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020,8,15]]},"assertion":[{"value":"15 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop Soft Computing Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Arad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofa2018.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}