{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T19:59:30Z","timestamp":1780775970107,"version":"3.54.1"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Physical Communication"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.phycom.2026.103124","type":"journal-article","created":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:45:43Z","timestamp":1777131943000},"page":"103124","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Reduced complexity construction of low density parity check codes for ultra reliable and low latency communications"],"prefix":"10.1016","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9137-5471","authenticated-orcid":false,"given":"Junsheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4509-2939","authenticated-orcid":false,"given":"Linqi","family":"Zou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.phycom.2026.103124_bib0001","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","article-title":"Low-density parity-check codes","volume":"8","author":"Gallager","year":"2003","journal-title":"IRE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.phycom.2026.103124_bib0002","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1049\/el:19970362","article-title":"Near shannon limit performance of low density parity check codes","volume":"33","author":"MacKay","year":"1997","journal-title":"Electron. Lett."},{"issue":"3","key":"10.1016\/j.phycom.2026.103124_bib0003","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCOM.2018.1700839","article-title":"Design of low-density parity check codes for 5G new radio","volume":"56","author":"Richardson","year":"2018","journal-title":"IEEE Commun. Mag."},{"issue":"2","key":"10.1016\/j.phycom.2026.103124_bib0004","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/MCOM.2018.1800181","article-title":"Short block-length codes for ultra-reliable low latency communications","volume":"57","author":"Shirvanimoghaddam","year":"2018","journal-title":"IEEE Commun. Mag."},{"key":"10.1016\/j.phycom.2026.103124_bib0005","series-title":"GLOBECOM\u201901. IEEE Global Telecommunications Conference (Cat. No. 01CH37270)","first-page":"995","article-title":"Progressive edge-growth tanner graphs","volume":"2","author":"Hu","year":"2001"},{"key":"10.1016\/j.phycom.2026.103124_bib0006","series-title":"Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.","first-page":"1990","article-title":"A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph","volume":"2","author":"Li","year":"2004"},{"issue":"7","key":"10.1016\/j.phycom.2026.103124_bib0007","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1109\/TIT.2007.899516","article-title":"Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: a finite field approach","volume":"53","author":"Lan","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10.1016\/j.phycom.2026.103124_bib0008","doi-asserted-by":"crossref","first-page":"3208","DOI":"10.1109\/TCOMM.2016.2579641","article-title":"Design of LDPC codes based on multipath EMD strategies for progressive edge growth","volume":"64","author":"Healy","year":"2016","journal-title":"IEEE Trans. Commun."},{"issue":"5","key":"10.1016\/j.phycom.2026.103124_bib0009","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1109\/LWC.2018.2825988","article-title":"Low-rate PBRL-LDPC codes for URLLC in 5G","volume":"7","author":"Wu","year":"2018","journal-title":"IEEE Wirel. Commun. Lett."},{"issue":"8","key":"10.1016\/j.phycom.2026.103124_bib0010","doi-asserted-by":"crossref","first-page":"5275","DOI":"10.1109\/TCOMM.2019.2916605","article-title":"Reed-Solomon based quasi-cyclic LDPC codes: designs, girth, cycle structure, and reduction of short cycles","volume":"67","author":"Xiao","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.phycom.2026.103124_bib0011","series-title":"2021 15th International Symposium on Medical Information and Communication Technology (ISMICT)","first-page":"157","article-title":"Construction of quasi-cyclic low-density parity-check codes based on quadratic residue codes","author":"Li","year":"2021"},{"issue":"9","key":"10.1016\/j.phycom.2026.103124_bib0012","doi-asserted-by":"crossref","first-page":"5290","DOI":"10.1109\/TCOMM.2024.3392774","article-title":"On construction of low-density parity-check codes for ultra-reliable and low latency communications","volume":"72","author":"Zou","year":"2024","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.phycom.2026.103124_bib0013","series-title":"A Classical Introduction to Modern Number Theory","volume":"84","author":"Ireland","year":"1990"}],"container-title":["Physical Communication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1874490726001333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1874490726001333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T19:22:29Z","timestamp":1780773749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1874490726001333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":13,"alternative-id":["S1874490726001333"],"URL":"https:\/\/doi.org\/10.1016\/j.phycom.2026.103124","relation":{},"ISSN":["1874-4907"],"issn-type":[{"value":"1874-4907","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reduced complexity construction of low density parity check codes for ultra reliable and low latency communications","name":"articletitle","label":"Article Title"},{"value":"Physical Communication","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.phycom.2026.103124","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103124"}}