{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:54Z","timestamp":1772283714702,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,3]],"date-time":"2011-11-03T00:00:00Z","timestamp":1320278400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00373-011-1103-5","type":"journal-article","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T16:21:49Z","timestamp":1320250909000},"page":"187-212","source":"Crossref","is-referenced-by-count":8,"title":["Some Combinatorial Aspects of Constructing Bipartite-Graph Codes"],"prefix":"10.1007","volume":"29","author":[{"given":"Alexander A.","family":"Davydov","sequence":"first","affiliation":[]},{"given":"Massimo","family":"Giulietti","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Marcugini","sequence":"additional","affiliation":[]},{"given":"Fernanda","family":"Pambianco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,3]]},"reference":[{"key":"1103_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge (1963)"},{"key":"1103_CR2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R.M. Tanner","year":"1981","unstructured":"Tanner R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR3","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"Sipser M., Spielman D.: Expander codes. IEEE Trans. Inf. Theory 42, 1710\u20131722 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/4234.781010","volume":"3","author":"M. Lentmaier","year":"1999","unstructured":"Lentmaier M., Zigangirov K.S.: On generalized low-density parity-check codes based on Hamming component codes. IEEE Commun. Lett. 3, 248\u2013260 (1999)","journal-title":"IEEE Commun. Lett."},{"key":"1103_CR5","unstructured":"Boutros, J., Pothier, O., Z\u00e9mor, G.: Generalized low density (Tanner) codes. In: Proc. IEEE Int. Conf. Commun. (ICC), vol. 1. Vancouver, BC, Canada, pp. 441\u2013445 (1999)"},{"key":"1103_CR6","doi-asserted-by":"crossref","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y. Kou","year":"2001","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. Inf. Theory 47, 2711\u20132736 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR7","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1109\/TIT.2002.1003853","volume":"48","author":"A. Barg","year":"2002","unstructured":"Barg A., Z\u00e9mor G.: Error exponents of expander codes. IEEE Trans. Inf. Theory 48, 1725\u20131729 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR8","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1109\/TCOMM.2003.816946","volume":"51","author":"S.J. Johnson","year":"2003","unstructured":"Johnson S.J., Weller S.R.: Resolvable 2-designs for regular low-density parity-check codes. IEEE Trans. Commun. 51, 1413\u20131419 (2003)","journal-title":"IEEE Trans. Commun."},{"key":"1103_CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1002\/ett.4460140503","volume":"14","author":"S.R. Weller","year":"2003","unstructured":"Weller S.R., Johnson S.J.: Regular low-density parity-check codes from oval designs. Eur. Trans. Telecommun. 14, 399\u2013409 (2003)","journal-title":"Eur. Trans. Telecommun."},{"key":"1103_CR10","unstructured":"Johnson, S.J., Weller, S.R.: High-rate LDPC codes from unital designs. In: Proc. IEEE Globecom Conf. San Francisco, CA, USA, pp. 150\u2013152 (2003)"},{"key":"1103_CR11","volume-title":"Error Control Coding: Fundamental and Applications","author":"S. Lin","year":"2004","unstructured":"Lin S., Costello D.J. Jr: Error Control Coding: Fundamental and Applications. 2nd edn. Prentice Hall, Upper Saddle River, NJ (2004)","edition":"2"},{"key":"1103_CR12","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"M.P.C. Fossorier","year":"2004","unstructured":"Fossorier M.P.C.: Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inf. Theory 50, 1788\u20131793 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR13","doi-asserted-by":"crossref","first-page":"2378","DOI":"10.1109\/TIT.2004.834760","volume":"50","author":"J.-L. Kim","year":"2004","unstructured":"Kim J.-L., Peled U.N., Perepelitsa I., Pless V., Friedland S.: Explicit construction of families of LDPC codes with no 4-cycles. IEEE Trans. Inf. Theory 50, 2378\u20132388 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR14","doi-asserted-by":"crossref","first-page":"2966","DOI":"10.1109\/TIT.2004.838370","volume":"50","author":"R.M. Tanner","year":"2004","unstructured":"Tanner R.M., Sridhara D., Sridharan A., Fuja T.E., Costello D.J. Jr: LDPC block and convolutional codes based on circulant matrices. IEEE Trans. Inf. Theory 50, 2966\u20132984 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR15","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/B:DESI.0000029233.20866.41","volume":"32","author":"K.E. Mellinger","year":"2004","unstructured":"Mellinger K.E.: LDPC codes from triangle-free line sets. Des. Codes Cryptogr. 32, 341\u2013350 (2004)","journal-title":"Des. Codes Cryptogr."},{"key":"1103_CR16","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TIT.2004.840867","volume":"51","author":"H. Tang","year":"2005","unstructured":"Tang H., Xu J., Lin S., Abdel-Ghaffar K.A.S.: Codes on finite geometries. IEEE Trans. Inf. Theory 51, 572\u2013596 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20059","volume":"49","author":"K.E. Mellinger","year":"2005","unstructured":"Mellinger K.E., Mubayi D.: Constructions of bipartite graphs from finite geometries. J. Graph Theory 49, 1\u201310 (2005)","journal-title":"J. Graph Theory"},{"key":"1103_CR18","doi-asserted-by":"crossref","unstructured":"Miladinovi\u0107, N., Fossorier, M.: Generalized LDPC codes with Reed\u2013Solomon and BCH codes as component codes for binary channels. In: Proc. IEEE Global Comm. Conf. (Globecom), vol. 3. St. Luis, MO, USA, pp. 6\u201310 (2005)","DOI":"10.1109\/GLOCOM.2005.1577850"},{"key":"1103_CR19","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TIT.2005.860415","volume":"52","author":"A. Barg","year":"2006","unstructured":"Barg A., Z\u00e9mor G.: Distances properties of expander codes. IEEE Trans. Inf. Theory 52, 78\u201390 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR20","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TCOMM.2005.861667","volume":"54","author":"Z.-W. Li","year":"2006","unstructured":"Li Z.-W., Chen L., Zeng L., Lin S., Fong W.H.: Efficient encoding of quasi-cyclic low-density parity-check codes. IEEE Trans. Commun. 54, 71\u201381 (2006)","journal-title":"IEEE Trans. Commun."},{"key":"1103_CR21","doi-asserted-by":"crossref","unstructured":"Gabidulin, E., Moinian, A., Honary, B.: Generalized construction of quasi-cyclic regular LDPC codes based on permutation matrices. In: Proc. Int. Symp. Inf. Theory 2006, ISIT 2006. Seattle, USA, pp. 679\u2013683 (2006)","DOI":"10.1109\/ISIT.2006.261871"},{"key":"1103_CR22","doi-asserted-by":"crossref","unstructured":"H\u00f8holdt, T., Justesen, J.: Graph codes with Reed\u2013Solomon component codes. In: Proc. Int. Symp. Inf. Theory 2006, ISIT 2006. Seattle, USA, pp. 2022\u20132026 (2006)","DOI":"10.1109\/ISIT.2006.261904"},{"key":"1103_CR23","unstructured":"Gabidulin, E.M.: On LDPC matrices equivalent to Vandermonde matrices. In: Proc. X Int. Workshop Algebraic Comb. Coding Theory, ACCT 2006. Zvenigorod, Russia, pp. 97\u2013101 (2006). http:\/\/dcn.infos.ru\/acct\/ACCT2006\/papers\/gabi.pdf"},{"key":"1103_CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.24138\/jcomss.v2i3.283","volume":"2","author":"G. Liva","year":"2006","unstructured":"Liva G., Song S., Lan L., Zhang Y., Lin S., Ryan W.E.: Design of LDPC codes: a survey and new results. J. Commun. Softw. Syst. 2, 191\u2013211 (2006)","journal-title":"J. Commun. Softw. Syst."},{"key":"1103_CR25","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10623-006-0022-6","volume":"40","author":"S.V. Droms","year":"2006","unstructured":"Droms S.V., Mellinger K.E., Meyer C.: LDPC codes generated by conics in the classical projective plane. Des. Codes Crypt. 40, 343\u2013356 (2006)","journal-title":"Des. Codes Crypt."},{"key":"1103_CR26","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/TIT.2006.887082","volume":"53","author":"J. Xu","year":"2007","unstructured":"Xu J., Chen L., Djurdjevic I., Abdel-Ghaffar K.: Construction of regular and irregular LDPC codes: geometry decomposition and masking. IEEE Trans. Inf. Theory 53, 121\u2013134 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR27","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1109\/TIT.2007.899516","volume":"53","author":"L. Lan","year":"2007","unstructured":"Lan L., Zeng L., Tai Y.Y., Chen L., Lin S., Abdel-Ghaffar K.: Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: a finite field approach. IEEE Trans. Inf. Theory 53, 2429\u20132458 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1103_CR28","unstructured":"Afanassiev, V.B., Davydov, A.A., Zyablov, V.V.: Low density concatenated codes with Reed\u2013Solomon component codes. In: Proc. XI Int. Symp. on Problems of Redundancy in Inf. and Control Syst. St.-Petersburg, Russia, pp. 47\u201351 (2007). http:\/\/k36.org\/redundancy2007"},{"key":"1103_CR29","unstructured":"Mazumdar, A.: Analysis of bipartite graph codes on the binary erasure channel. In: Proc. 4\u20135 Annual Allerton Conf., UIUC. Illinois, USA, pp. 897\u2013904 (2007)"},{"key":"1103_CR30","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10623-006-9017-6","volume":"42","author":"J.-L. Kim","year":"2007","unstructured":"Kim J.-L., Mellinger K.E., Storme L.: Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles. Des. Codes Crypt. 42, 73\u201392 (2007)","journal-title":"Des. Codes Crypt."},{"key":"1103_CR31","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TCOMM.2008.041077","volume":"56","author":"N. Miladinovi\u0107","year":"2008","unstructured":"Miladinovi\u0107 N., Fossorier M.P.C.: Generalized LDPC codes and generalized stopping sets. IEEE Trans. Commun. 56, 201\u2013212 (2008)","journal-title":"IEEE Trans. Commun."},{"key":"1103_CR32","unstructured":"Zyablov, V., Johannesson, R., Lon\u010dar, M., Rybin, P.: On the error-correcting capabilities of low-complexity decoded LDPC codes with constituent Hamming codes. In: Proc. XI Int. Workshop Algebraic Comb. Coding Theory, ACCT2008. Pamporovo, Bulgaria, pp. 325\u2013337 (2008). http:\/\/www.moi.math.bas.bg\/acct2008\/b54.pdf"},{"key":"1103_CR33","unstructured":"Davydov, A.A., Giulietti, M., Marcugini, S., Pambianco, F.: Symmetric configurations for bipartite-graph codes. In: Proc. XI Int. Workshop Algebraic Comb. Coding Theory, ACCT2008. Pamporovo, Bulgaria, pp. 63\u201369 (2008). http:\/\/www.moi.math.bas.bg\/acct2008\/b11.pdf"},{"key":"1103_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jcd.20179","volume":"17","author":"V. Pepe","year":"2009","unstructured":"Pepe V., Storme L., Van de Voorde G.: Small weight codewords in the LDPC codes arising from linear representations of geometries. J. Combin. Des. 17, 1\u201324 (2009)","journal-title":"J. Combin. Des."},{"issue":"4","key":"1103_CR35","first-page":"301","volume":"9","author":"V.B. Afanassiev","year":"2009","unstructured":"Afanassiev V.B., Davydov A.A., Zyablov V.V.: Low density parity check codes on bipartite graphs with Reed\u2013Solomon constituent codes. Electron. J. Inf. Process. 9(4), 301\u2013331 (2009)","journal-title":"Electron. J. Inf. Process."},{"key":"1103_CR36","first-page":"59","volume":"58","author":"C. Castleberry","year":"2010","unstructured":"Castleberry C., Hunsberger K., Mellinger K.E.: LDPC codes arising from hyperovals. Bull. Inst. Combin. Appl. 58, 59\u201372 (2010)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1103_CR37","doi-asserted-by":"crossref","first-page":"3132","DOI":"10.1016\/j.disc.2009.06.010","volume":"310","author":"V. Pepe","year":"2010","unstructured":"Pepe V., Storme L., Van de Voorde G.: On codewords in the dual code of classical generalised quadrangles and classical polar spaces. Discrete Math. 310, 3132\u20133148 (2010)","journal-title":"Discrete Math."},{"key":"1103_CR38","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries over Finite Fields","author":"J.W.P. Hirschfeld","year":"1998","unstructured":"Hirschfeld J.W.P.: Projective Geometries over Finite Fields. 2nd edn. Oxford Science, Oxford (1998)","edition":"2"},{"key":"1103_CR39","volume-title":"The CRC Handbook of Combinatorial Designs","year":"2006","unstructured":"Colbourn, C.J., Dinitz, J. (eds.): The CRC Handbook of Combinatorial Designs. 2nd edn. CRC Press, Boca Raton (2006)","edition":"2"},{"key":"1103_CR40","first-page":"34","volume":"15","author":"H. Gropp","year":"1990","unstructured":"Gropp H.: On the existence and non-existence of configurations n k . J. Combin. Inform. System Sci. 15, 34\u201348 (1990)","journal-title":"J. Combin. Inform. System Sci."},{"key":"1103_CR41","doi-asserted-by":"crossref","unstructured":"Gropp, H.: Non-symmetric configurations with deficiencies 1 and 2. In: Combinatorics 90, Ann. Discrete Math., vol 52, pp. 227\u2013239 (1992)","DOI":"10.1016\/S0167-5060(08)70915-4"},{"key":"1103_CR42","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/j.disc.2008.01.011","volume":"309","author":"M. Funk","year":"2009","unstructured":"Funk M., Labbate D., Napolitano V.: Tactical (de-)compositions of symmetric configurations. Discret. Math. 309, 741\u2013747 (2009)","journal-title":"Discret. Math."},{"key":"1103_CR43","first-page":"119","volume":"35","author":"M. Abreu","year":"2006","unstructured":"Abreu M., Funk M., Labbate D., Napolitano V.: On (minimal) regular graphs of girth 6. Australas. J. Combin. 35, 119\u2013132 (2006)","journal-title":"Australas. J. Combin."},{"key":"1103_CR44","first-page":"63","volume":"3","author":"A. G\u00e1cs","year":"2008","unstructured":"G\u00e1cs A., H\u00e9ger T.: On geometric constructions of (k, g)-graphs. Contrib. Discr. Math. 3, 63\u201380 (2008)","journal-title":"Contrib. Discr. Math."},{"key":"1103_CR45","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-62012-6","volume-title":"Finite Geometries","author":"P. Dembowski","year":"1968","unstructured":"Dembowski P.: Finite Geometries. Springer, Berlin (1968)"},{"key":"1103_CR46","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1008775818040","volume":"13","author":"N. Hamilton","year":"2001","unstructured":"Hamilton N., Penttila T.: Sets of type (a, b) from subgroups of \u0393 L(1, p R ). J. Algebraic Combin. 13, 67\u201376 (2001)","journal-title":"J. Algebraic Combin."},{"key":"1103_CR47","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1006\/eujc.2000.0471","volume":"22","author":"J. Coykendall","year":"2001","unstructured":"Coykendall J., Dover J.: Sets with few intersection numbers from Singer subgroup orbits. Eur. J. Combin. 22, 455\u2013464 (2001)","journal-title":"Eur. J. Combin."},{"key":"1103_CR48","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1002\/jcd.20230","volume":"18","author":"A.A. Davydov","year":"2010","unstructured":"Davydov A.A., Giulietti M., Marcugini S., Pambianco F.: New inductive constructions of complete caps in PG(N, q), q even. J. Comb. Des. 18, 176\u2013201 (2010)","journal-title":"J. Comb. Des."},{"key":"1103_CR49","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1002\/jcd.20131","volume":"15","author":"M. Giulietti","year":"2007","unstructured":"Giulietti M.: Small complete caps in PG(N, q), q even. J. Comb. Des. 15, 420\u2013436 (2007)","journal-title":"J. Comb. Des."},{"issue":"7","key":"1103_CR50","first-page":"139","volume":"6","author":"A.A. Davydov","year":"2009","unstructured":"Davydov A.A., Giulietti M., Marcugini S., Pambianco F.: On sharply transitive sets in PG(2, q). Innov. Incid. Geom. 6(7), 139\u2013151 (2009)","journal-title":"Innov. Incid. Geom."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1103-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1103-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1103-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T10:22:44Z","timestamp":1713090164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1103-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,3]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1103"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1103-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,3]]}}}