{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:45:54Z","timestamp":1775054754023,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T00:00:00Z","timestamp":1548201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["6732"],"award-info":[{"award-number":["6732"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00373-019-02007-4","type":"journal-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T09:11:03Z","timestamp":1548321063000},"page":"451-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["LDPC Codes from \n                \n                  \n                \n                $$\\mu $$\n                \n                  \n                    \u03bc\n                  \n                \n              -Geodetic Graphs Obtained from Block Designs"],"prefix":"10.1007","volume":"35","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanja","family":"Rukavina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"\u0160imac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,23]]},"reference":[{"key":"2007_CR1","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1109\/TIT.2004.828144","volume":"50","author":"B Ammar","year":"2004","unstructured":"Ammar, B., Honary, B., Kou, Y., Xu, J., Lin, S.: Construction of low density parity-check codes based on balanced incomplete block designs. IEEE Trans. Inform. Theory 50, 1257\u20131267 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2007_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth, T., Jungnickel, D., Lenz, H.: Design Theory, vol. I. Cambridge University Press, Cambridge, England (1999)"},{"key":"2007_CR3","first-page":"145","volume":"3","author":"D Crnkovi\u0107","year":"2016","unstructured":"Crnkovi\u0107, D., Dumi\u010di\u0107 Danilovi\u0107, D., Rukavina, S.: Enumeration of symmetric (45,12,3) designs with nontrivial automorphisms. J. Algebra Comb. Discrete Struct. Appl. 3, 145\u2013154 (2016)","journal-title":"J. Algebra Comb. Discrete Struct. Appl."},{"key":"2007_CR4","first-page":"23","volume":"103","author":"D Crnkovi\u0107","year":"2017","unstructured":"Crnkovi\u0107, D., Rukavina, S., Sim\u010di\u0107, L.: On triplanes of order twelve admitting an automorphism of order six and their binary and ternary codes. Util. Math. 103, 23\u201340 (2017)","journal-title":"Util. Math."},{"key":"2007_CR5","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","volume":"48","author":"C Di","year":"2002","unstructured":"Di, C., Proietti, D., Telatar, I.E., Richardson, T.J., Urbanke, R.L.: Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inform. Theory 48, 1570\u20131579 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2007_CR6","doi-asserted-by":"crossref","unstructured":"Diao, Q., Tai, Y.Y., Lin, S., Abdel-Ghaffar, K.: Trapping Set Structure of LDPC Codes on Finite Geometries. IEEE Int. Symp. on Inf. Theory, pp 3088\u20133092 (2013)","DOI":"10.1109\/ITA.2013.6502922"},{"key":"2007_CR7","volume-title":"Graph theory, Fourth edition, Graduate Texts in Mathematics 173","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph theory, Fourth edition, Graduate Texts in Mathematics 173. Springer, Heidelberg (2010)"},{"key":"2007_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TCOMM.2011.101011.110120","volume":"60","author":"H Falsafain","year":"2011","unstructured":"Falsafain, H., Esmaeili, M.: A new construction of structured binary regular LDPC codes based on steiner systems with parameter \n                    \n                      \n                    \n                    $$t>2$$\n                    \n                      \n                        \n                          t\n                          >\n                          2\n                        \n                      \n                    \n                  . IEEE Trans. Commun. 60, 74\u201380 (2011)","journal-title":"IEEE Trans. Commun."},{"key":"2007_CR9","unstructured":"Fujiwara, Y.: Instantaneous quantum channel estimation during quantum information processing. (2014). \n                    arXiv:1405.6267"},{"key":"2007_CR10","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1109\/TIT.2015.2398436","volume":"61","author":"Y Fujiwara","year":"2015","unstructured":"Fujiwara, Y., Gruner, A., Vandendriessche, P.: High-rate quantum low-density parity-check codes assisted by reliable qubits. IEEE Trans. Inform. Theory 61, 1860\u20131878 (2015)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2007_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge (1963)"},{"key":"2007_CR12","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. \n                    http:\/\/www.codetables.de\n                    \n                  , Accessed 29 Jan 2016"},{"key":"2007_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.32917\/hmj\/1206137446","volume":"3","author":"N Hamada","year":"1973","unstructured":"Hamada, N.: On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes. Hiroshima Math. J. 3, 153\u2013226 (1973)","journal-title":"Hiroshima Math. J."},{"key":"2007_CR14","unstructured":"Ivanov, F., Zyablov, V.: LDPC codes based on Steiner quadruple systems and permutation matrices. In: Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory, Svetlogorsk, Russia pp. 175\u2013180 (2014)"},{"key":"2007_CR15","first-page":"970","volume":"2","author":"SJ Johnson","year":"2001","unstructured":"Johnson, S.J., Weller, S.R.: Construction of low-density parity-check codes from Kirkman triple systems. IEEE Global Commun. Conf. 2, 970\u2013974 (2001)","journal-title":"IEEE Global Commun. Conf."},{"key":"2007_CR16","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y Kou","year":"2002","unstructured":"Kou, Y., Lin, S., Fossorier, M.P.C.: Low density parity check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inform. Theory 47, 2711\u20132736 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2007_CR17","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1109\/LCOMM.2013.091113.131646","volume":"17","author":"G Lechner","year":"2013","unstructured":"Lechner, G., Pacher, C.: Estimating channel parameters from the syndrome of a linear code. IEEE Commun. Lett. 17, 2148\u20132151 (2013)","journal-title":"IEEE Commun. Lett."},{"key":"2007_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1049\/el:19970362","volume":"32","author":"DJC MacKay","year":"1997","unstructured":"MacKay, D.J.C., Neal, R.M.: Near Shannon limit performance of low density parity check codes. Electron. Lett. 32, 457\u2013458 (1997)","journal-title":"Electron. Lett."},{"key":"2007_CR19","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"2006","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 12th edn. North-Holland, Amsterdam (2006)","edition":"12"},{"key":"2007_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MSP.2004.1267048","volume":"21","author":"JMF Moura","year":"2004","unstructured":"Moura, J.M.F., Lu, J., Zhang, H.: Structured low-density parity-check codes. IEEE Signal Process. Mag. 21, 42\u201355 (2004)","journal-title":"IEEE Signal Process. Mag."},{"key":"2007_CR21","doi-asserted-by":"crossref","unstructured":"Pacher, C., Grabenweger, P., Simos, D.E.: Weight distribution of the syndrome of linear codes and connections to combinatorial designs. Inform. Theory (ISIT), pp. 3038\u20133042 (2016)","DOI":"10.1109\/ISIT.2016.7541857"},{"key":"2007_CR22","doi-asserted-by":"publisher","first-page":"3248","DOI":"10.1109\/TIT.2010.2048448","volume":"56","author":"C Schlegel","year":"2010","unstructured":"Schlegel, C.: On the dynamics of the error floor behavior in (regular) LDPC codes. IEEE Trans. Inform. Theory 56, 3248\u20133264 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2007_CR23","first-page":"101","volume":"24","author":"N Srinivasan","year":"1987","unstructured":"Srinivasan, N., Opatrny, J., Alagar, V.S.: Construction of geodetic and bigeodetic blocks of connectivity \n                    \n                      \n                    \n                    $$k\\ge 3$$\n                    \n                      \n                        \n                          k\n                          \u2265\n                          3\n                        \n                      \n                    \n                   and their relation to block designs. Ars Combin. 24, 101\u2013114 (1987)","journal-title":"Ars Combin."},{"key":"2007_CR24","volume-title":"Combinatorial Designs: Construction and Analysis","author":"DR Stinson","year":"2004","unstructured":"Stinson, D.R.: Combinatorial Designs: Construction and Analysis. Springer, New York (2004)"},{"key":"2007_CR25","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/LCOMM.2011.122810.102182","volume":"15","author":"V Toto-Zarasoa","year":"2011","unstructured":"Toto-Zarasoa, V., Roumy, A., Guillemot, C.: Maximum likelihood BSC parameter estimation for the Slepian\u2013Wolf problem. IEEE Commun. Lett. 15, 232\u2013234 (2011)","journal-title":"IEEE Commun. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02007-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02007-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02007-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T19:19:25Z","timestamp":1579720765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02007-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,23]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2007"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02007-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,23]]},"assertion":[{"value":"15 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}