{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T22:24:18Z","timestamp":1696371858819},"reference-count":18,"publisher":"Maria Curie-Sklodowska University","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"DOI":"10.2478\/v10065-011-0003-x","type":"journal-article","created":{"date-parts":[[2012,1,14]],"date-time":"2012-01-14T19:52:38Z","timestamp":1326570758000},"source":"Crossref","is-referenced-by-count":2,"title":["On LDPC codes corresponding to affine parts of generalized polygons"],"prefix":"10.17951","volume":"11","author":[{"given":"Monika","family":"Polak","sequence":"first","affiliation":[]},{"given":"Vasyl","family":"Ustimenko","sequence":"additional","affiliation":[]}],"member":"7349","reference":[{"key":"1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0195-6698(02)00119-1","article-title":"Extremal properties of regular and affine generalized polygons as tactical configurations","volume":"24","author":"V. Ustimenko","year":"2003","journal-title":"European Journal of Combinatorics"},{"key":"2","first-page":"5","article-title":"Tanner type codes arising from large girth graphs","author":"P. Guinand","year":"1997"},{"key":"3","first-page":"111","article-title":"Graph theoretic construction of generalized product codes","author":"P. Guinand","year":"1997"},{"key":"4","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1006\/eujc.1993.1048","article-title":"New examples of graphs without small cycles and of large size","volume":"14","author":"F. Lazebnik","year":"1993","journal-title":"European Journal of Combinatorics"},{"key":"5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0012-365X(96)83019-6","article-title":"A characterization of the components of the graphs <i>D<\/i>(<i>k, q<\/i>)","volume":"157","author":"F. Lazebnik","year":"1996","journal-title":"Discrete Mathematics"},{"key":"6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(94)00058-L","article-title":"Explicit construction of graphs with an arbitrary large girth and of large size","volume":"60","author":"F. Lazebnik","year":"1995","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","article-title":"A new series of dense graphs of high girth","volume":"32","author":"F. Lazebnik","year":"1995","journal-title":"Bulletin (New Series) of the AMS"},{"issue":"5","key":"8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","article-title":"A recursive approach to low density codes","volume":"27","author":"R. Tanner","year":"1984","journal-title":"IEEE Transactions on Information Theory IT"},{"key":"9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","article-title":"Low-Density Parity-Checks Codes","volume":"8","author":"R. Gallager","year":"1962","journal-title":"IRE Trans of Info Thy"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of error correcting codes","author":"W. Huffman","year":"2003"},{"key":"11","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":"C. Shannon","year":"1948","journal-title":"Bell System Technical Journal"},{"key":"12","volume-title":"Weaver Warren, The Mathematical Theory of Communication","author":"C. Shannon","year":"1963"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance regular graphs","author":"A. Brower","year":"1989"},{"key":"14","volume-title":"Extremal Graph Theory","author":"B. Bollobas","year":"1978"},{"key":"15","volume-title":"LDPC Codes: An Introduction","author":"A. Shokrollahi","year":"2002"},{"issue":"3","key":"16","first-page":"249","article-title":"On some applications of graph theory to cryptography and turbocoding, Special issue of Albanian Journal of Mathematics: Proceedings of the NATO Advanced Studies Institute \"New challenges in digital communications\", May 2008","volume":"2","author":"T. Shaska","year":"2008","journal-title":"University of Vlora"},{"issue":"N4","key":"17","first-page":"387","article-title":"On the extremal regular directed graphs without commutative diagrams and their applications in coding theory and cryptography, Albanian","volume":"1","author":"V. Ustimenko","year":"2007","journal-title":"J. of Mathematics, Special Issue Algebra and Computational Algebraic Geometry"},{"key":"18","doi-asserted-by":"crossref","unstructured":"Shaska T., Huffman W. C., Joener D., Ustimenko V. (editors), Advances in Coding Theory and Cryptography, Series on Coding and Cryptology 3 (2007): 181.","DOI":"10.1142\/9789812772022"}],"container-title":["Annales UMCS, Informatica"],"original-title":[],"link":[{"URL":"https:\/\/journals.umcs.pl\/ai\/article\/download\/3316\/2510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T15:47:48Z","timestamp":1653493668000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.umcs.pl\/ai\/article\/view\/3316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":18,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.2478\/v10065-011-0003-x","relation":{},"ISSN":["2083-3628","1732-1360"],"issn-type":[{"value":"2083-3628","type":"electronic"},{"value":"1732-1360","type":"print"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}