{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:32:20Z","timestamp":1764333140021,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T00:00:00Z","timestamp":1653350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T00:00:00Z","timestamp":1653350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["187711","188430"],"award-info":[{"award-number":["187711","188430"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>New constructions for moderate-density parity-check (MDPC) codes using finite geometry are proposed. We design a parity-check matrix for the main family of binary codes as the concatenation of two matrices: the incidence matrix between points and lines of the Desarguesian projective plane and the incidence matrix between points and ovals of a projective bundle. A projective bundle is a special collection of ovals which pairwise meet in a unique point. We determine the minimum distance and the dimension of these codes, and we show that they have a natural quasi-cyclic structure. We consider alternative constructions based on an incidence matrix of a Desarguesian projective plane and compare their error-correction performance with regards to a modification of Gallager\u2019s bit-flipping decoding algorithm. In this setting, our codes have the best possible error-correction performance after one round of bit-flipping decoding given the parameters of the code\u2019s parity-check matrix.<\/jats:p>","DOI":"10.1007\/s10623-022-01054-y","type":"journal-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T11:03:56Z","timestamp":1653390236000},"page":"2943-2966","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Moderate-density parity-check codes from projective bundles"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4304-2521","authenticated-orcid":false,"given":"Jessica","family":"Bariffi","sequence":"first","affiliation":[]},{"given":"Sam","family":"Mattheus","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Neri","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Rosenthal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,24]]},"reference":[{"key":"1054_CR1","doi-asserted-by":"crossref","unstructured":"Adriaensen S., Denaux L.: Small weight codewords of projective geometric codes. J. Comb. Theory Ser. A, 180:Paper No. 105395, 34 (2021).","DOI":"10.1016\/j.jcta.2020.105395"},{"key":"1054_CR2","doi-asserted-by":"crossref","unstructured":"Assmus E.F. Jr., Key J.D.: Designs and Their Codes, vol. 103. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1992).","DOI":"10.1017\/CBO9781316529836"},{"issue":"1","key":"1054_CR3","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1006\/jcta.2002.3265","volume":"99","author":"B Bagchi","year":"2002","unstructured":"Bagchi B., Inamdar S.P.: Projective geometric codes. J. Comb. Theory Ser. A 99(1), 128\u2013142 (2002).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"1054_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.36045\/bbms\/1103408578","volume":"1","author":"RD Baker","year":"1994","unstructured":"Baker R.D., Brown J.M.N., Ebert G.L., Fisher J.C.: Projective bundles. Bull. Belg. Math. Soc.-Simon Stevin 1(3), 329\u2013336 (1994).","journal-title":"Bull. Belg. Math. Soc.-Simon Stevin"},{"key":"1054_CR5","unstructured":"Bariffi J.: A Finite Geometry Construction for MDPC-Codes. Master\u2019s thesis, University of Zurich. https:\/\/www.math.uzh.ch\/index.php?id=pmastertheses &key1=604 (2020)."},{"issue":"4","key":"1054_CR6","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/S0021-9800(69)80030-X","volume":"6","author":"P Delsarte","year":"1969","unstructured":"Delsarte P.: A geometric approach to a class of cyclic codes. J. Comb. Theory 6(4), 340\u2013358 (1969).","journal-title":"J. Comb. Theory"},{"key":"1054_CR7","doi-asserted-by":"crossref","unstructured":"Gallager R.: Low-density parity-check codes. IRE Trans. Inf. Theory IT 8, 21\u201328 (1962).","DOI":"10.1109\/TIT.1962.1057683"},{"key":"1054_CR8","unstructured":"Glynn D.G.: Finite projective planes and related combinatorial systems. PhD thesis, University of Adelaide Adelaide (1978)."},{"key":"1054_CR9","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1002\/j.1538-7305.1966.tb01687.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham R.L., MacWilliams J.: On the number of information symbols in difference-set cyclic codes. Bell Syst. Tech. J. 45, 1057\u20131070 (1966).","journal-title":"Bell Syst. Tech. J."},{"key":"1054_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries Over Finite Fields","author":"J Hirschfeld","year":"1998","unstructured":"Hirschfeld J.: Projective Geometries Over Finite Fields. Oxford University Press, Oxford (1998)."},{"key":"1054_CR11","doi-asserted-by":"crossref","unstructured":"Janoska A.: MDPC decoding algorithms and their impact on the McEliece cryptosystem. In: 2018 Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 1085\u20131089. IEEE (2018).","DOI":"10.15439\/2018F99"},{"key":"1054_CR12","unstructured":"Johnson S.J.: Low-density parity-check codes from combinatorial designs. PhD thesis, University of Newcastle, Australia (2004)."},{"key":"1054_CR13","unstructured":"Johnson S.J., Weller S.R.: Construction of low-density parity-check codes from Kirkman triple systems. In: IEEE Global Telecommunications Conference, vol.\u00a02, pp. 970\u2013974. IEEE (2001)."},{"key":"1054_CR14","doi-asserted-by":"crossref","unstructured":"Johnson S.J., Weller S.R.: Regular low-density parity-check codes from combinatorial designs. In: Proceedings 2001 IEEE Information Theory Workshop, pp. 90\u201392. IEEE (2001).","DOI":"10.1109\/ITW.2001.955146"},{"issue":"5","key":"1054_CR15","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1002\/ett.4460140503","volume":"14","author":"SJ Johnson","year":"2003","unstructured":"Johnson S.J., Weller S.R.: Regular low-density parity-check codes from oval designs. Eur. Trans. Telecommun. 14(5), 399\u2013409 (2003).","journal-title":"Eur. Trans. Telecommun."},{"issue":"2","key":"1054_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/TCOMM.2003.822737","volume":"52","author":"SJ Johnson","year":"2004","unstructured":"Johnson S.J., Weller S.R.: Codes for iterative decoding from partial geometries. IEEE Trans. Commun. 52(2), 236\u2013243 (2004).","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"1054_CR17","doi-asserted-by":"publisher","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 Cryptogr. 42(1), 73\u201392 (2007).","journal-title":"Des. Codes Cryptogr."},{"issue":"10","key":"1054_CR18","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.N., Perepelitsa I., Pless V., Friedland S.: Explicit construction of families of LDPC codes with no 4-cycles. IEEE Trans. Inf. Theory 50(10), 2378\u20132388 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1054_CR19","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 M.P.C.: Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inf. Theory 47(7), 2711\u20132736 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1054_CR20","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.4153\/CJM-1989-049-4","volume":"41","author":"CW Lam","year":"1989","unstructured":"Lam C.W., Thiel L., Swiercz S.: The non-existence of finite projective planes of order 10. Can. J. Math. 41(6), 1117\u20131123 (1989).","journal-title":"Can. J. Math."},{"issue":"2","key":"1054_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10623-010-9393-9","volume":"56","author":"M Lavrauw","year":"2010","unstructured":"Lavrauw M., Van de Voorde G.: On linear sets on a projective line. Des. Codes Cryptogr. 56(2), 89\u2013104 (2010).","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"1054_CR22","doi-asserted-by":"publisher","first-page":"3890","DOI":"10.1109\/TIT.2005.856936","volume":"51","author":"Z Liu","year":"2005","unstructured":"Liu Z., Pados D.A.: LDPC codes from generalized polygons. IEEE Trans. Inf. Theory 51(11), 3890\u20133898 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1054_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"GA Margulis","year":"1982","unstructured":"Margulis G.A.: Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2(1), 71\u201378 (1982).","journal-title":"Combinatorica"},{"key":"1054_CR24","doi-asserted-by":"crossref","unstructured":"Misoczki R., Tillich J.-P., Sendrier N., Barreto P.S.: MDPC-McEliece: New McEliece variants from moderate density parity-check codes. In: 2013 IEEE International Symposium on Information Theory, pp. 2069\u20132073. IEEE (2013).","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"1054_CR25","unstructured":"Ouzan S., Be\u2019ery Y.: Moderate-density parity-check codes. arXiv preprint arXiv:0911.3262 (2009)."},{"issue":"1","key":"1054_CR26","doi-asserted-by":"publisher","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. Comb. Des. 17(1), 1\u201324 (2009).","journal-title":"J. Comb. Des."},{"key":"1054_CR27","unstructured":"Prange E.: The use of coset equivalence in the analysis and decoding of group codes. Technical report, Air Force Cambridge Research Labs Hanscom AFB MA (1959)."},{"issue":"134","key":"1054_CR28","first-page":"27","volume":"1952","author":"B Qvist","year":"1952","unstructured":"Qvist B.: Some remarks concerning curves of the second degree in a finite plane. Ann. Acad. Sci. Fennicae Ser. A. I. Math.-Phys. 1952(134), 27 (1952).","journal-title":"Ann. Acad. Sci. Fennicae Ser. A. I. Math.-Phys."},{"issue":"2","key":"1054_CR29","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"T Richardson","year":"2001","unstructured":"Richardson T., Shokrollahi A., Urbanke R.: Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inf. Theory 47(2), 619\u2013637 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1054_CR30","unstructured":"Rosenthal J., Vontobel P.O.: Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis. In: Proceedings of the 38-th Allerton Conference on Communication, Control, and Computing, pp. 248\u2013257 (2000)."},{"issue":"2","key":"1054_CR31","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TIT.1967.1053994","volume":"13","author":"L Rudolph","year":"1967","unstructured":"Rudolph L.: A class of majority logic decodable codes (corresp). IEEE Trans. Inf. Theory 13(2), 305\u2013307 (1967).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1054_CR32","doi-asserted-by":"publisher","first-page":"414","DOI":"10.4153\/CJM-1955-045-x","volume":"7","author":"B Segre","year":"1955","unstructured":"Segre B.: Ovals in a finite projective plane. Can. J. Math. 7, 414\u2013416 (1955).","journal-title":"Can. J. Math."},{"issue":"2","key":"1054_CR33","doi-asserted-by":"publisher","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.: Codes on finite geometries. IEEE Trans. Inf. Theory 51(2), 572\u2013596 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1054_CR34","doi-asserted-by":"crossref","unstructured":"Tillich J.-P.: The decoding failure probability of MDPC codes. In: 2018 IEEE International Symposium on Information Theory (ISIT), pp. 941\u2013945. IEEE (2018).","DOI":"10.1109\/ISIT.2018.8437843"},{"issue":"3","key":"1054_CR35","doi-asserted-by":"publisher","first-page":"405","DOI":"10.3934\/amc.2010.4.405","volume":"4","author":"P Vandendriessche","year":"2010","unstructured":"Vandendriessche P.: LDPC codes associated with linear representations of geometries. Adv. Math. Commun. 4(3), 405\u2013417 (2010).","journal-title":"Adv. Math. Commun."},{"key":"1054_CR36","doi-asserted-by":"crossref","unstructured":"Vontobel P., Tanner R.: Construction of codes based on finite generalized quadrangles for iterative decoding. In: Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No. 01CH37252), p. 223. IEEE (2001).","DOI":"10.1109\/ISIT.2001.936086"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01054-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01054-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01054-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T20:39:14Z","timestamp":1727296754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01054-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,24]]},"references-count":36,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1054"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01054-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,5,24]]},"assertion":[{"value":"9 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}