{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:40:10Z","timestamp":1746348010430,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448922"},{"type":"electronic","value":"9783662448939"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44893-9_7","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T03:15:08Z","timestamp":1408504508000},"page":"74-88","source":"Crossref","is-referenced-by-count":0,"title":["On LDPC Codes Based on Families of Expanding Graphs of Increasing Girth without Edge-Transitive Automorphism Groups"],"prefix":"10.1007","author":[{"given":"Monika","family":"Polak","sequence":"first","affiliation":[]},{"given":"Vasyl","family":"Ustimenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF02579382","volume":"6","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Eigenvalues, geometric expanders, sorting in rounds and Ramsey theory. Combinatorica\u00a06(3), 207\u2013219 (1986)","journal-title":"Combinatorica"},{"key":"7_CR2","unstructured":"Biggs, N.L.: Algebraic Graph Theory, 2nd edn. Cambridge University Press (1993)"},{"key":"7_CR3","unstructured":"Biggs, N.L.: Graphs with large girth. Ars Combin. In: Eleventh British Combinatorial Conference, London, vol.\u00a025(C), pp. 73\u201380 (1988)"},{"key":"7_CR4","volume-title":"Extremal Graph Theory","author":"B. Bollobas","year":"1978","unstructured":"Bollobas, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF01285816","volume":"12","author":"P. Chiu","year":"1992","unstructured":"Chiu, P.: Cubic Ramanujan graphs. Combinatorica\u00a012(3), 275\u2013285 (1992)","journal-title":"Combinatorica"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P.: Graph theory and probability. Canad. Math. Monthly\u00a011, 34\u201338 (1959)","journal-title":"Canad. Math. Monthly"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Gallager, R.G.: Low-Density Parity-Checks Codes. Monograph. M.I.T. Press (1963)","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Guinand, P., Lodge, J.: Graph theoretic construction of generalized product codes. In: IEEE International Symposium on Information Theory, ISIT 1997, Ulm, Germany, June 29-July 4, p. 111 (1997)","DOI":"10.1109\/ISIT.1997.613026"},{"key":"7_CR9","unstructured":"Guinand, P., Lodge, J.: Tanner type codes arising from large girth graphs. In: Canadian Workshop on Information Theory CWIT 1997, Toronto, Ontario, Canada, pp. 5\u20137 (1997)"},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S. Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S.)\u00a043(4), 439\u2013561 (2006)","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF02579157","volume":"4","author":"W. Imrich","year":"1984","unstructured":"Imrich, W.: Explicit construction of regular graphs without small cycles. Combinatorica\u00a04(1), 53\u201359 (1984)","journal-title":"Combinatorica"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/S0012-365X(99)90107-3","volume":"197-198","author":"F. Lazebnik","year":"1999","unstructured":"Lazebnik, F., Ustimenko, V., Woldar, A.J.: Polarities and 2k-cycle-free graphs. Discrete Mathematics\u00a0197-198, 503\u2013513 (1999)","journal-title":"Discrete Mathematics"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0012-365X(96)83019-6","volume":"157","author":"F. Lazebnik","year":"1996","unstructured":"Lazebnik, F., Ustimenko, V., Woldar, A.J.: A characterization of the components of the graphs D(k,q). Discrete Mathematics\u00a0157, 271\u2013283 (1996)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","volume":"32","author":"F. Lazebnik","year":"1995","unstructured":"Lazebnik, F., Ustimenko, V., Woldar, A.J.: A new series of dense graphs of high girth. Bulletin (New Series) of the AMS\u00a032(1), 73\u201379 (1995)","journal-title":"Bulletin (New Series) of the AMS"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Lazebnik, F., Ustimenko, V., Woldar, A.J.: Polarities and 2k-cycle-free graphs. Discrete Mathematics 197-198, 503\u2013513 (1999)","DOI":"10.1016\/S0012-365X(99)90107-3"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotsky","year":"1988","unstructured":"Lubotsky, A., Philips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"7_CR17","unstructured":"Luby, M.G., Mitzenmacher, M., Shokrollahi, M.A., Spielman, D.A.: Improved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propagation. In: ISIT 1998-IEEE International Symposium of Information Theory, Cambridge, USA, p. 171 (1998)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-60693-9_13","volume-title":"Cryptography and Coding","author":"D.J.C. MacKay","year":"1995","unstructured":"MacKay, D.J.C., Neal, R.M.: Good Codes Based on Very Sparse Matrices. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol.\u00a01025, pp. 100\u2013111. Springer, Heidelberg (1995)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"MacKay, D., Postol, M.: Weakness of Margulis and Ramanujan Margulis Low Dencity Parity Check Codes. Electronic Notes in Theoretical Computer Science, vol. 74 (2003)","DOI":"10.1016\/S1571-0661(04)80768-0"},{"issue":"1","key":"7_CR20","first-page":"51","volume":"24","author":"G.A. Margulis","year":"1988","unstructured":"Margulis, G.A.: Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problemy Peredachi Informatsii\u00a024(1), 51\u201360 (1988)","journal-title":"Problemy Peredachi Informatsii"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579283","volume":"2","author":"G.A. Margulis","year":"1982","unstructured":"Margulis, G.A.: Explicit construction of graphs without short cycles and low density codes. Combinatorica\u00a02, 1\u201378 (1982)","journal-title":"Combinatorica"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M. Morgenstern","year":"1994","unstructured":"Morgenstern, M.: Existence and explicit constructions of q\u2009+\u20091-regular Ramanujan graphs for every prime power q. J. Combin. Theory Ser. B\u00a062(1), 44\u201362 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Polak, M., Ustimenko, V.: On LDPC codes Corresponding to Infinite Family of Graphs A(n,K). In: Proceedings of Federated Conference on Computer Science and Informations Systems, Wroc\u0142aw, Poland, September 9-12, pp. 567\u2013570 (2012)","DOI":"10.2478\/v10065-012-0034-y"},{"key":"7_CR24","unstructured":"Polak, M., Ustimenko, V.: Appendix for article On LDPC codes based on families of expanding graphs of increasing girth without edge-transitive automorphism groups. University of Maria Curie Sk\u0142odowska (2014), http:\/\/umcs.pl\/pl\/zaklad-algebry-i-matematyki-dyskretnej,1336.htm"},{"issue":"2","key":"7_CR25","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"T.J. Richardson","year":"2001","unstructured":"Richardson, T.J., Urbanke, R.L.: The Capacity of Low-Density Parity Check Codes Under Message-Passing Decoding. IEEE Transaction on Informarion Theory\u00a047(2), 599\u2013618 (2001)","journal-title":"IEEE Transaction on Informarion Theory"},{"issue":"1-3","key":"7_CR26","first-page":"205","volume":"21","author":"S. Akos","year":"2000","unstructured":"Akos, S.: Large Families of Cospectral Graphs. Designs, Codes and Cryptography\u00a021(1-3), 205\u2013208 (2000)","journal-title":"Designs, Codes and Cryptography"},{"issue":"6","key":"7_CR27","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.A.: Expander codes. IEEE Trans. on Info. Theory\u00a042(6), 1710 (1996)","journal-title":"IEEE Trans. on Info. Theory"},{"key":"7_CR28","unstructured":"Shannon, C.E., Warren, W.: The Mathematical Theory of Communication. University of Illinois Press (1963)"},{"issue":"5","key":"7_CR29","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R.M. Tanner","year":"1984","unstructured":"Tanner, R.M.: A recursive approach to low density codes. IEEE Transactions on Information Theory IT\u00a027(5), 533\u2013547 (1984)","journal-title":"IEEE Transactions on Information Theory IT"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0195-6698(02)00119-1","volume":"24","author":"V. Ustimenko","year":"2003","unstructured":"Ustimenko, V., Woldar, A.: Extremal properties of regular and affine generalized polygons as tactical configurations. Eur. J. Combinator.\u00a024, 99 (2003)","journal-title":"Eur. J. Combinator."},{"key":"7_CR31","first-page":"214","volume":"326","author":"V. Ustimenko","year":"2005","unstructured":"Ustimenko, V.: On linguistic dynamical systems, families of graphs of large girth, and cryptography. Zapiski Nauchnykh Seminarov POMI\u00a0326, 214\u2013234 (2005)","journal-title":"Zapiski Nauchnykh Seminarov POMI"},{"key":"7_CR32","first-page":"44","volume":"8","author":"V. Ustimenko","year":"2013","unstructured":"Ustimenko, V.: On the K-theory of graph based dynamical systems and its applications. Dopovidi Natsional\u2019noi Akademii nauk Ukrainy\u00a08, 44\u201351 (2013)","journal-title":"Dopovidi Natsional\u2019noi Akademii nauk Ukrainy"},{"key":"7_CR33","first-page":"42","volume":"2","author":"V. Ustimenko","year":"2013","unstructured":"Ustimenko, V.: On extremal graph theory and symbolic computations. Dopovidi Natsional\u2019noi Akademii nauk Ukrainy\u00a02, 42\u201349 (2013)","journal-title":"Dopovidi Natsional\u2019noi Akademii nauk Ukrainy"},{"key":"7_CR34","first-page":"11","volume":"XI","author":"U. Roma\u0144czuk","year":"2011","unstructured":"Roma\u0144czuk, U., Ustimenko, V.: On the key exchange protocol with new cubical maps based on graphs. Annales UMCS Informaticea\u00a0XI, 11\u201329 (2011)","journal-title":"Annales UMCS Informaticea"},{"key":"7_CR35","series-title":"SCI","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-29694-9_11","volume-title":"Artificial Intelligence, Evolutionary Computing and Metaheuristics","author":"V. Ustimenko","year":"2013","unstructured":"Ustimenko, V., Roma\u0144czuk, U.: On Extremal Graph Theory, Explicit algebraic constructions of extremal graphs and corresponding Turing encryption machines. In: Yang, X.-S. (ed.) Artificial Intelligence, Evolutionary Computing and Metaheuristics. SCI, vol.\u00a0427, pp. 257\u2013285. Springer, Heidelberg (2013)"},{"issue":"2-3","key":"7_CR36","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02579225","volume":"4","author":"A. Weiss","year":"1984","unstructured":"Weiss, A.: Girths of bipartite sextet graphs. Combinatorica\u00a04(2-3), 241\u2013245 (1984)","journal-title":"Combinatorica"}],"container-title":["Communications in Computer and Information Science","Cryptography and Security Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44893-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:27:21Z","timestamp":1746347241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44893-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448922","9783662448939"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44893-9_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}