{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:01Z","timestamp":1772283541887,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,11,11]],"date-time":"2006-11-11T00:00:00Z","timestamp":1163203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,11,11]],"date-time":"2006-11-11T00:00:00Z","timestamp":1163203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s10623-006-9017-6","type":"journal-article","created":{"date-parts":[[2006,11,10]],"date-time":"2006-11-10T15:47:58Z","timestamp":1163173678000},"page":"73-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles"],"prefix":"10.1007","volume":"42","author":[{"given":"Jon-Lark","family":"Kim","sequence":"first","affiliation":[]},{"given":"Keith E.","family":"Mellinger","sequence":"additional","affiliation":[]},{"given":"Leo","family":"Storme","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,11]]},"reference":[{"key":"9017_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00181609","volume":"27","author":"B Bagchi","year":"1988","unstructured":"Bagchi B, Narasimha Sastry NS (1988) Codes associated with generalized polygons. Geom Dedicata 27:1\u20138","journal-title":"Geom Dedicata"},{"issue":"6","key":"9017_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/4234.681360","volume":"2","author":"MC Davey","year":"1998","unstructured":"Davey MC, MacKay DJC (1998) Low density parity check codes over GF(q). IEEE Commun Lett 2(6): 165\u2013167","journal-title":"IEEE Commun Lett"},{"key":"9017_CR3","doi-asserted-by":"publisher","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"MPC Fossorier","year":"2004","unstructured":"Fossorier MPC (2004) Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inform. Theory 50:1788\u20131793","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9017_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"RG Gallager","year":"1962","unstructured":"Gallager RG, (1962) Low density parity check codes. IRE Trans. Inform. Theory 8:21\u201328","journal-title":"IRE Trans. Inform. Theory"},{"key":"9017_CR5","unstructured":"Hirschfeld JWP, Thas JA (1991) General galois geometries. Oxford University Press"},{"key":"9017_CR6","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/ICC.2004.1312605","volume":"2","author":"XY Hu","year":"2004","unstructured":"Hu XY, Fossorier MPC, Eleftheriou E (2004) On the computation of the minimum distance of low-density parity-check codes. 2004 IEEE Int Conf on Commun 2:767\u2013771","journal-title":"2004 IEEE Int Conf on Commun"},{"key":"9017_CR7","unstructured":"Johnson SJ, Weller SR (2001) Construction of low-density parity-check codes from Kirkman triple systems. In: Proceedings of the IEEE globecom conference, San Antonio, TX, available at http:\/\/www.ee.newcastle.edu.au\/users\/staff\/steve\/"},{"key":"9017_CR8","unstructured":"Johnson SJ, Weller SR (2001) Regular low-density parity-check codes from combinatorial designs. In: Proceedings of the IEEE Information Theory workshop. Cairns, Australia,:90\u201392"},{"key":"9017_CR9","unstructured":"Johnson SJ, Weller SR (2002) Codes for iterative decoding from partial geometries. In: Proceedings of the IEEE international symposium information theory. Switzerland, June 30 \u2013 July 5, 6 page, extended abstract, available at http:\/\/murray.newcastle.edu.au\/users\/staff\/steve\/"},{"key":"9017_CR10","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/TIT.2004.834760","volume":"50","author":"J-L Kim","year":"2004","unstructured":"Kim J-L, Peled U, Perepelitsa I, Pless V, Friedland S (2004) Explicit construction of families of LDPC codes with no 4-cycles. IEEE Trans Inform Theory. 50:2378\u20132388","journal-title":"IEEE Trans Inform Theory."},{"issue":"7","key":"9017_CR11","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y Kou","year":"2001","unstructured":"Kou Y, Lin S, Fossorier MPC (2001) Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans Inform Theory 47(7):2711\u20132736","journal-title":"IEEE Trans Inform Theory"},{"key":"9017_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(94)00058-L","volume":"60","author":"F Lazebnik","year":"1997","unstructured":"Lazebnik F, Ustimenko VA (1997) Explicit construction of graphs with arbitrary large girth and of large size. Discrete Applied Math 60:275\u2013284","journal-title":"Discrete Applied Math"},{"issue":"11","key":"9017_CR13","doi-asserted-by":"publisher","first-page":"3890","DOI":"10.1109\/TIT.2005.856936","volume":"51","author":"Z Liu","year":"2005","unstructured":"Liu Z, Pados DA (2005) LDPC codes from generalized polygons. IEEE Trans Inform Theory 51(11):3890\u20133898","journal-title":"IEEE Trans Inform Theory"},{"key":"9017_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJC MacKay","year":"1999","unstructured":"MacKay DJC (1999) Good error correcting codes based on very sparse matrices. IEEE Trans Inform Theory 45:399-431","journal-title":"IEEE Trans Inform Theory"},{"key":"9017_CR15","first-page":"113","volume-title":"vol 123. IMA in Mathematics and its Applications","author":"DJC MacKay","year":"2000","unstructured":"MacKay DJC, Davey MC (2000) Evaluation of Gallager codes for short block length and high rate applications, codes, systems and graphical models. In: Marcus B, Rosenthal J (ed) vol 123. IMA in Mathematics and its Applications. Springer-Verlag, New York, pp.113\u2013130"},{"issue":"18","key":"9017_CR16","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"DJC MacKay","year":"1996","unstructured":"MacKay DJC, Neal RM (1996) Near Shannon limit performance of low density parity check codes. Electron Lett 32(18):1645\u20131646","journal-title":"Electron Lett"},{"key":"9017_CR17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"GA Margulis","year":"1982","unstructured":"Margulis GA (1982) Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2:71\u201378","journal-title":"Combinatorica"},{"key":"9017_CR18","volume-title":"Finite generalized quadrangles","author":"SE Payne","year":"1984","unstructured":"Payne SE, Thas JA (1984) Finite generalized quadrangles. Pitman Advanced Publishing Program, MA"},{"key":"9017_CR19","unstructured":"Rosenthal J, Vontobel PO (2000) Construction of LDPC codes using Ramanujan graphs and ideas from Margulis. In: Proceedings of the 38th Allerton conference on communications, control, and computing. Voulgaris PG, Srikant R, (eds) Coordinated Science Lab, Monticello, IL, Oct. 4\u20136, pp.248\u2013257"},{"key":"9017_CR20","doi-asserted-by":"publisher","first-page":"3735","DOI":"10.1109\/TIT.2006.878231","volume":"52","author":"P Sin","year":"2006","unstructured":"Sin P, Xiang Q (2006) On the dimension of certain LDPC codes based on q-regular bipartite graphs. IEEE Trans Inform Theory 52:3735\u20133737","journal-title":"IEEE Trans Inform Theory"},{"key":"9017_CR21","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser M, Spielman DA (1996) Expander codes. IEEE Trans Inform Theory 42:1710\u20131722","journal-title":"IEEE Trans Inform Theory"},{"key":"9017_CR22","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"RM Tanner","year":"1981","unstructured":"Tanner RM (1981) A recursive approach to low-complexity codes. IEEE Trans Inform Theory 27:533\u2013547","journal-title":"IEEE Trans Inform Theory"},{"key":"9017_CR23","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1109\/18.910591","volume":"47","author":"RM Tanner","year":"2001","unstructured":"Tanner RM (2001) Minimum-distance bounds by graph analysis. IEEE Trans Inform Theory 47:808\u2013821","journal-title":"IEEE Trans Inform Theory"},{"key":"9017_CR24","doi-asserted-by":"publisher","first-page":"2966","DOI":"10.1109\/TIT.2004.838370","volume":"50","author":"RM Tanner","year":"2004","unstructured":"Tanner RM, Sridhara D, Sridharan A, Fuja TE, Costello DJ Jr. (2004) LDPC block and convolutional codes based on circulant matrices. IEEE Trans Inform Theory 50:2966\u20132984","journal-title":"IEEE Trans Inform Theory"},{"key":"9017_CR25","unstructured":"Vontobel PO, Tanner RM (2001) Construction of codes based on finite generalized quadrangles for iterative decoding. In: Proceedings of 2001 IEEE international symposium information theory, Washington, DC, p 223"},{"issue":"5","key":"9017_CR26","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1002\/ett.939","volume":"14","author":"SR Weller","year":"2003","unstructured":"Weller SR, Johnson SJ (2003) Regular low-density parity-check codes from oval designs. Eur Trans on Telecommun 14(5):399-409","journal-title":"Eur Trans on Telecommun"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9017-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-006-9017-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9017-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9017-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T08:55:46Z","timestamp":1652691346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-006-9017-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,11]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["9017"],"URL":"https:\/\/doi.org\/10.1007\/s10623-006-9017-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,11]]},"assertion":[{"value":"4 April 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2006","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2006","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2006","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}