{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:17:13Z","timestamp":1771467433460,"version":"3.50.1"},"reference-count":24,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:p> Some new approaches for constructing near regular binary low-density parity-check (LDPC) codes free of 4-cycles are proposed using dual of certain combinatorial designs which are [Formula: see text]-configurations. The present constructions further broaden the class of code lengths. The present constructions give higher code rates of near regular LDPC codes compared to the earlier codes with respect to same code length. <\/jats:p>","DOI":"10.1142\/s1793830924500976","type":"journal-article","created":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T23:18:46Z","timestamp":1727824726000},"source":"Crossref","is-referenced-by-count":1,"title":["Near regular LDPC codes based on combinatorial designs"],"prefix":"10.1142","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5117-7311","authenticated-orcid":false,"given":"Shyam","family":"Saurabh","sequence":"first","affiliation":[{"name":"Department of Mathematics, Tata College, Chaibasa, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0708-3668","authenticated-orcid":false,"given":"Sheet Nihal","family":"Topno","sequence":"additional","affiliation":[{"name":"University Department of Mathematics, Ranchi University, Ranchi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6266-6711","authenticated-orcid":false,"given":"Kishore","family":"Sinha","sequence":"additional","affiliation":[{"name":"Birsa Agricultural University, Ranchi, India"},{"name":"D201, Oceanus Tranquil, Ambedkar Road, Bangalore 560036, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,11,9]]},"reference":[{"key":"S1793830924500976BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.12.003"},{"issue":"3","key":"S1793830924500976BIB002","first-page":"2150022","volume":"13","author":"Alinejad M.","year":"2021","journal-title":"Disc. Math. Algor. Appl."},{"key":"S1793830924500976BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.040410.00042"},{"key":"S1793830924500976BIB004","series-title":"Applied Mathematics","volume-title":"Tables of Two-Associate-Class Partially Balanced Designs","volume":"63","author":"Clatworthy W. H.","year":"1973"},{"key":"S1793830924500976BIB005","volume-title":"Circulant Matrices","author":"Davis P. J.","year":"2012","edition":"2"},{"key":"S1793830924500976BIB006","volume-title":"Theory of Block Designs","author":"Dey A.","year":"1986"},{"key":"S1793830924500976BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280640"},{"key":"S1793830924500976BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3279327"},{"key":"S1793830924500976BIB009","volume-title":"Frames and Resolvable Designs, Uses Constructions and Existence","author":"Furino S.","year":"1996"},{"key":"S1793830924500976BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012581"},{"key":"S1793830924500976BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.816946"},{"key":"S1793830924500976BIB012","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.12.3732"},{"key":"S1793830924500976BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-017-0777-z"},{"key":"S1793830924500976BIB014","first-page":"301","volume-title":"Handbook of Combinatorial Designs","author":"Launey W. D.","year":"2007","edition":"2"},{"key":"S1793830924500976BIB015","first-page":"1200","volume-title":"Proc. IEEE Wireless Communications and Networking Conf.","author":"Lee J.","year":"2005"},{"key":"S1793830924500976BIB016","first-page":"35","volume-title":"Handbook of Combinatorial Designs","author":"Mathon R.","year":"2007","edition":"2"},{"key":"S1793830924500976BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2017.09.016"},{"key":"S1793830924500976BIB018","volume-title":"Constructions and Combinatorial Problems in Design of Experiments","author":"Raghavarao D.","year":"1971"},{"key":"S1793830924500976BIB019","doi-asserted-by":"publisher","DOI":"10.1142\/5846"},{"key":"S1793830924500976BIB020","first-page":"93","volume":"95","author":"Saurabh S.","year":"2022","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830924500976BIB021","first-page":"83","volume":"97","author":"Saurabh S.","year":"2023","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830924500976BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-023-02088-2"},{"key":"S1793830924500976BIB023","volume":"7","author":"Saurabh S.","year":"2023","journal-title":"Secur. Priv."},{"key":"S1793830924500976BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.841966"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830924500976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T02:12:15Z","timestamp":1752545535000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830924500976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,9]]},"references-count":24,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["10.1142\/S1793830924500976"],"URL":"https:\/\/doi.org\/10.1142\/s1793830924500976","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,9]]},"article-number":"2450097"}}