{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:03:19Z","timestamp":1757617399759,"version":"3.44.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"28","license":[{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-025-20619-2","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T02:58:00Z","timestamp":1737601080000},"page":"34663-34680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction of Multi-Rate QCLDPC codes using a search-based method for satellite communication"],"prefix":"10.1007","volume":"84","author":[{"given":"Gurinderjit","family":"Kaur","sequence":"first","affiliation":[]},{"given":"Manish","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Rajesh Kumar","family":"Narula","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0353-174X","authenticated-orcid":false,"given":"Digvijay","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Jaskarn Singh","family":"Bhullar","sequence":"additional","affiliation":[]},{"given":"Jasvinder","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Parul","family":"Parul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,23]]},"reference":[{"issue":"1","key":"20619_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"Gallager R (1962) 1962_(Gallager)_(IRE Trans. Info. Theo.)_Low-density parity-check codes.pdf. IRE Trans Inform Theory 8(1):21\u201328","journal-title":"IRE Trans Inform Theory"},{"issue":"18","key":"20619_CR2","doi-asserted-by":"publisher","first-page":"3","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):3\u20136","journal-title":"Electron Lett"},{"issue":"7","key":"20619_CR3","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TCOMM.2004.831353","volume":"52","author":"L Chen","year":"2004","unstructured":"Chen L, Xu J, Djurdjevic I, Lin S (2004) Near-Shannon-limit quasi-cyclic low-density parity-check codes. IEEE Trans Commun 52(7):1038\u20131042. https:\/\/doi.org\/10.1109\/TCOMM.2004.831353","journal-title":"IEEE Trans Commun"},{"issue":"2","key":"20619_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TCOMM.2004.841966","volume":"53","author":"J Xu","year":"2005","unstructured":"Xu J, Chen L, Zeng L, Lan L, Lin S (2005) Construction of low-density parity-check codes by superposition. IEEE Trans Commun 53(2):243\u2013251. https:\/\/doi.org\/10.1109\/TCOMM.2004.841966","journal-title":"IEEE Trans Commun"},{"issue":"1","key":"20619_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1080\/03772063.2019.1604170","volume":"68","author":"M Mishra","year":"2022","unstructured":"Mishra M (2022) LDPC codes and digital forensics\u2013a perspective approach. IETE J Res 68(1):291\u2013298. https:\/\/doi.org\/10.1080\/03772063.2019.1604170","journal-title":"IETE J Res"},{"issue":"2","key":"20619_CR6","first-page":"356","volume":"19","author":"MR Islam","year":"2010","unstructured":"Islam MR, Kim J (2010) Quasi cyclic low density parity check code for high SNR data transfer. Radioengineering 19(2):356\u2013362","journal-title":"Radioengineering"},{"issue":"4","key":"20619_CR7","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s12095-019-00405-2","volume":"12","author":"J Singh","year":"2020","unstructured":"Singh J, Gupta M, Bhullar JS (2020) On the search of smallest QC-LDPC code with girth six and eight. Cryptogr Commun 12(4):711\u2013723. https:\/\/doi.org\/10.1007\/s12095-019-00405-2","journal-title":"Cryptogr Commun"},{"issue":"1","key":"20619_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10623-019-00667-0","volume":"88","author":"J Singh","year":"2020","unstructured":"Singh J, Gupta M, Bhullar JS (2020) Construction of girth-8 (3, L)-QC-LDPC codes of smallest CPM size using column multipliers. Des Codes Cryptogr. 88(1):41\u201349. https:\/\/doi.org\/10.1007\/s10623-019-00667-0","journal-title":"Des Codes Cryptogr."},{"issue":"February","key":"20619_CR9","doi-asserted-by":"publisher","first-page":"22250","DOI":"10.1109\/ACCESS.2023.3249464","volume":"11","author":"J Wang","year":"2023","unstructured":"Wang J, Zhang J, Zhou Q, Zhang L (2023) Full-length row-multiplier QC-LDPC Codes with girth eight and short circulant sizes. IEEE Access 11(February):22250\u201322265. https:\/\/doi.org\/10.1109\/ACCESS.2023.3249464","journal-title":"IEEE Access"},{"key":"20619_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/BMSB.2013.6621689","volume-title":"IEEE International Symposium on Broadband Multimedia Systems and Broadcasting","author":"L Fan","year":"2013","unstructured":"Fan L, Peng K, Pan C, Song J (2013) Multiple-rate multiple-length QC-LDPC codes design with near shannon limit performance. IEEE International Symposium on Broadband Multimedia Systems and Broadcasting. IEEE, London, pp 1\u20136. https:\/\/doi.org\/10.1109\/BMSB.2013.6621689"},{"key":"20619_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/ISTC.2014.6955081","volume-title":"International Symposium Turbo Codes Iterative Information Processing (ISTC)","author":"M Beermann","year":"2014","unstructured":"Beermann M, Wickert F, Vary P (2014) Highly flexible design of multi-rate multi-length quasi-cyclic LDPC codes. International Symposium Turbo Codes Iterative Information Processing (ISTC), 1st edn. IEEE, Bremen, pp 37\u201341. https:\/\/doi.org\/10.1109\/ISTC.2014.6955081","edition":"1"},{"key":"20619_CR12","doi-asserted-by":"publisher","first-page":"50229","DOI":"10.1109\/ACCESS.2018.2868963","volume":"6","author":"H Li","year":"2018","unstructured":"Li H, Bai B, Mu X, Zhang J, Xu H (2018) Algebra-Assisted construction of quasi-cyclic ldpc codes for 5g new radio. IEEE Access 6:50229\u201350244. https:\/\/doi.org\/10.1109\/ACCESS.2018.2868963","journal-title":"IEEE Access"},{"issue":"1","key":"20619_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TCOMM.2009.0901.060256","volume":"57","author":"AI Vila Casado","year":"2009","unstructured":"Vila Casado AI, Weng WY, Valle S, Wesel RD (2009) Multiple-rate low-density parity-check codes with constant blocklength. IEEE Trans Commun 57(1):75\u201383. https:\/\/doi.org\/10.1109\/TCOMM.2009.0901.060256","journal-title":"IEEE Trans Commun"},{"issue":"7","key":"20619_CR14","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan E (2009) Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans Inf Theory 55(7):3051\u20133073. https:\/\/doi.org\/10.1109\/TIT.2009.2021379","journal-title":"IEEE Trans Inf Theory"},{"key":"20619_CR15","unstructured":"ITU (2016) Digital satellite broadcasting system with flexible configuration (television, sound and data) (ITU-R BO.1784-1). 1:27. Available: https:\/\/www.itu.int\/dms_pubrec\/itu-r\/rec\/bo\/R-REC-BO.1784-1-201612-I!!PDF-E.pdf. Accessed 28 Mar 2024"},{"key":"20619_CR16","doi-asserted-by":"crossref","unstructured":"Chen, Chin-Long, and Robert A. Rutledge (1976) \"Error correcting codes for satellite communication channels.\" IBM Journal of Research and Development 20.2 pp 168\u2013175","DOI":"10.1147\/rd.202.0168"},{"issue":"3","key":"20619_CR17","first-page":"1","volume":"65","author":"S Ahn","year":"2018","unstructured":"Ahn S, Kim K, Myung S, Park S, Member S (2018) Comparison of low-density parity-check codes. IEEE Trans Broadcast 65(3):1\u20137","journal-title":"IEEE Trans Broadcast"},{"issue":"21","key":"20619_CR18","first-page":"19","volume":"178","author":"D Roddy","year":"2019","unstructured":"Roddy D, Sinha Ritwik, Verma Ananya, Choudhary Sachin (2019) General analysis of cube satellite technology: an overview. Int J Comput Applic 2006 178(21):19\u201322","journal-title":"Int J Comput Applic 2006"},{"issue":"3","key":"20619_CR19","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/s11227-011-0611-7","volume":"61","author":"SU Khan","year":"2012","unstructured":"Khan SU, Min-Allah N (2012) A goal programming based energy efficient resource allocation in data centers. J Supercomput 61(3):502\u2013519. https:\/\/doi.org\/10.1007\/s11227-011-0611-7","journal-title":"J Supercomput"},{"key":"20619_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/WCSP.2017.8171095","volume-title":"International Conference on Wireless Communications and Signal Processing (WCSP)","author":"T Chu","year":"2017","unstructured":"Chu T, Jiang XQ, Hou J, Hui-Ming W, Kong L (2017) Construction of multiple-rate LDPC codes using modified PEG. International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, Nanjing, pp 1\u20135. https:\/\/doi.org\/10.1109\/WCSP.2017.8171095"},{"issue":"6","key":"20619_CR21","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/LCOMM.2016.2553658","volume":"20","author":"P Zhao","year":"2016","unstructured":"Zhao P, Wang Z, Wang Q (2016) Construction of multiple-rate QC-LDPC codes using hierarchical row-splitting. IEEE Commun Lett 20(6):1068\u20131071. https:\/\/doi.org\/10.1109\/LCOMM.2016.2553658","journal-title":"IEEE Commun Lett"},{"issue":"12","key":"20619_CR22","doi-asserted-by":"publisher","first-page":"2370","DOI":"10.1109\/LCOMM.2016.2608938","volume":"20","author":"H Xu","year":"2016","unstructured":"Xu H, Feng D, Luo R, Bai B (2016) Construction of quasi-cyclic LDPC codes via masking with successive cycle elimination. IEEE Commun Lett 20(12):2370\u20132373. https:\/\/doi.org\/10.1109\/LCOMM.2016.2608938","journal-title":"IEEE Commun Lett"},{"issue":"11","key":"20619_CR23","doi-asserted-by":"publisher","first-page":"7154","DOI":"10.1109\/TCOMM.2021.3107578","volume":"69","author":"C Zhang","year":"2021","unstructured":"Zhang C, Mu X, Yuan J, Li H, Bai B (2021) Construction of multi-rate quasi-cyclic LDPC codes for satellite communications. IEEE Trans Commun 69(11):7154\u20137166. https:\/\/doi.org\/10.1109\/TCOMM.2021.3107578","journal-title":"IEEE Trans Commun"},{"key":"20619_CR24","doi-asserted-by":"publisher","first-page":"22724","DOI":"10.1109\/ACCESS.2017.2760801","volume":"5","author":"MB Qureshi","year":"2017","unstructured":"Qureshi MB, Alqahtani MA, Min-Allah N (2017) Grid resource allocation for real-time data-intensive tasks. IEEE Access 5:22724\u201322734. https:\/\/doi.org\/10.1109\/ACCESS.2017.2760801","journal-title":"IEEE Access"},{"key":"20619_CR25","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/9781118342015.ch7","volume":"1","author":"P Lindberg","year":"2012","unstructured":"Lindberg P et al (2012) Comparison and analysis of greedy energy-efficient scheduling algorithms for computational grids. Energy-Effic Distrib Comput Syst 1:189\u2013214. https:\/\/doi.org\/10.1002\/9781118342015.ch7","journal-title":"Energy-Effic Distrib Comput Syst"},{"issue":"5","key":"20619_CR26","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 Inf Theory 27(5):533\u2013547. https:\/\/doi.org\/10.1109\/TIT.1981.1056404","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"20619_CR27","doi-asserted-by":"publisher","first-page":"746","DOI":"10.3390\/app14020746","volume":"14","author":"Y He","year":"2024","unstructured":"He Y, Wang Y (2024) Research on low-density parity-check decoding algorithm for reliable transmission in satellite communications. Appl Sci 14(2):746. https:\/\/doi.org\/10.3390\/app14020746","journal-title":"Appl Sci"},{"issue":"7","key":"20619_CR28","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1109\/LCOMM.2016.2558152","volume":"20","author":"X Mu","year":"2016","unstructured":"Mu X, Shen C, Bai B (2016) A combined algebraic-and graph-based method for constructing structured RC-LDPC Codes. IEEE Commun Lett 20(7):1273\u20131276. https:\/\/doi.org\/10.1109\/LCOMM.2016.2558152","journal-title":"IEEE Commun Lett"},{"key":"20619_CR29","unstructured":"Sahu, Sankarsan (2021) \"A combination of encryption and error correction method used in satellite communications using AES.\""},{"key":"20619_CR30","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1016\/j.procs.2013.06.149","volume":"19","author":"E Amani","year":"2013","unstructured":"Amani E, Djouani K, Kurien A (2013) Review of parallel decoding of space-time block codes toward 4G wireless and mobile communications. Proc - Proc Comput Sci 19:1059\u20131067. https:\/\/doi.org\/10.1016\/j.procs.2013.06.149","journal-title":"Proc - Proc Comput Sci"},{"key":"20619_CR31","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-60693-9_13","volume":"1025","author":"DJC Mackay","year":"1995","unstructured":"Mackay DJC, Neal RM (1995) Good codes based on very sparse matrices. Lect Notes Comput Sci (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics) 1025:100\u2013111. https:\/\/doi.org\/10.1007\/3-540-60693-9_13","journal-title":"Lect Notes Comput Sci (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics)"},{"issue":"3","key":"20619_CR32","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1049\/jiere.1988.0022","volume":"58","author":"LJM Smith","year":"1988","unstructured":"Smith LJM, Burton GD (1988) Punctured coding for forward error correction in satellite communications. J Inst Electron Radio Eng 58(3):125\u2013131. https:\/\/doi.org\/10.1049\/jiere.1988.0022","journal-title":"J Inst Electron Radio Eng"},{"issue":"2","key":"20619_CR33","first-page":"380","volume":"3","author":"R Shedsale","year":"2012","unstructured":"Shedsale R, Sarwade N (2012) A review of construction methods for regular LDPC codes. Indian J Comput Sci Eng 3(2):380\u2013385","journal-title":"Indian J Comput Sci Eng"},{"issue":"19","key":"20619_CR34","doi-asserted-by":"publisher","first-page":"26857","DOI":"10.1007\/s11042-021-11664-8","volume":"81","author":"S Alrashed","year":"2022","unstructured":"Alrashed S, Min-Allah N, Ali I, Mehmood R (2022) COVID-19 outbreak and the role of digital twin. Multimed Tools Appl 81(19):26857\u201326871. https:\/\/doi.org\/10.1007\/s11042-021-11664-8","journal-title":"Multimed Tools Appl"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-025-20619-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-025-20619-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-025-20619-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:25:52Z","timestamp":1757132752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-025-20619-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,23]]},"references-count":34,"journal-issue":{"issue":"28","published-online":{"date-parts":[[2025,8]]}},"alternative-id":["20619"],"URL":"https:\/\/doi.org\/10.1007\/s11042-025-20619-2","relation":{},"ISSN":["1573-7721"],"issn-type":[{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2025,1,23]]},"assertion":[{"value":"27 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicting interests"}}]}}