{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:25:24Z","timestamp":1722943524726},"reference-count":19,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2016]]},"DOI":"10.12720\/jcm.11.5.455-461","type":"journal-article","created":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T08:46:13Z","timestamp":1480581973000},"source":"Crossref","is-referenced-by-count":4,"title":["Design of LDPC Codes Degree Sequences on Random Particle Swarm Optimization over Mixed Channel"],"prefix":"10.12720","author":[{"name":"Aeronautics and Astronautics Engineering College, Air Force Engineering University, Xi\u2019an, China","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangning","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linhua","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanhua","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaocheng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4977","published-online":{"date-parts":[[2016]]},"reference":[{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[1] R. Gallager, \"Low density parity-check codes,\" IEEE Transactions on Information Theory, vol. 8, no. 1, pp. 21-22, Jan. 1962.","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref1","doi-asserted-by":"crossref","unstructured":"[2] K. H. Huang, \"Performance comparison of LDPC block and spatially coupled codes over GF(q),\" IEEE Transactions on Information Theory, vol. 63, no. 3, pp. 592-604, Jan. 2015.","DOI":"10.1109\/TCOMM.2015.2397433"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[3] A. K. Pradhan, A. Thangaraj, and A. Subramanian, \"Construction of near-capacity protograph LDPC code sequences with block-error thresholds,\" IEEE Transactions on Communications, vol. 64, no. 1, pp. 27-37, Jan. 2016.","DOI":"10.1109\/TCOMM.2015.2500234"},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"[4] J. Zhang, G. J. Han, and F. Yi, \"Deterministic construction of compressed sensing matrices from protograph LDPC codes,\" IEEE Signal Processing Letters, vol. 11, no. 11, pp. 1960-1964, Oct. 2015.","DOI":"10.1109\/LSP.2015.2447934"},{"key":"ref4","doi-asserted-by":"crossref","unstructured":"[5] T. J. Richardson, M. A. Shokrollahi, and R. Urbanke, \"Design of capacity-approaching irregular low-density parity-check codes,\" IEEE Transaction on Information Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.","DOI":"10.1109\/18.910578"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"[6] V. Jamali, Y. Karimian, J. Huber, and M. A. Attari, \"On the design of fast convergent LDPC codes for the BECs: An optimization approach,\" IEEE Transactions on Communications, vol. 63, no. 2, pp. 351-363, Dec. 2014.","DOI":"10.1109\/TCOMM.2014.2385858"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[7] H. Saeedi and A. H. Banihashemi, \"New sequences of capacity achieving LDPC code ensembles over the binary erasure channel,\" IEEE Transactions on Information Theory, vol. 56, no. 12, pp. 6332-6346, Dec. 2010.","DOI":"10.1109\/TIT.2010.2053874"},{"key":"ref7","doi-asserted-by":"crossref","unstructured":"[8] S. Jeon and B. V. Kumar, \"Performance and complexity of 32 k-bit binary LDPC codes for magnetic recording channels,\" IEEE Transactions on Magnetics, vol. 46, no. 6, pp. 531-540, June 2010.","DOI":"10.1109\/TMAG.2010.2043067"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"[9] J. Lee, \"A new DC-Free multimode code design with error correction capability for optical storage systems,\" IEEE Transactions on Consumer Electronics, vol. 56, no. 3, pp. 1532-1536, Aug. 2010.","DOI":"10.1109\/TCE.2010.5606293"},{"key":"ref9","doi-asserted-by":"crossref","unstructured":"[10] P. P. Chen, L. J. Kong, Y. Fang, and L. Wang, \"The design of protograph LDPC codes for two-dimensional magnetic recording channels,\" IEEE Transactions on Magnetics, vol. 9, no. 7, pp. 391-396, July 2015.","DOI":"10.1109\/INTMAG.2015.7157698"},{"key":"ref10","unstructured":"[11] T. Ohkubo, J. Shiraishi, and T. Watanabe, \"Application of low density parity check codes to high-density optical disc storage using 17PP code,\" in Proc. Joint International Symposium on Optical Memory and Optical Data Storage, Waikiki, HI, May 10\u201314, 2010."},{"key":"ref11","unstructured":"[12] J. K. Dai, W. P. Guo, and D. H. Xu, \"The performance of LDPC coded frequency hopping system under follower jamming,\" presented at International Information and Communications Technologies Meeting, Nanjing, China, May 1\u20136, 2014."},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"[13] L. P. Mulholland, E. Paolini, and M. F. Flanagan, \"Design of LDPC code ensembles with fast convergence properties,\" in Proc. IEEE International Block sea Conf. on Communications and Networking, Constanta, 2015, pp. 53\u201357.","DOI":"10.1109\/BlackSeaCom.2015.7185085"},{"key":"ref13","doi-asserted-by":"crossref","unstructured":"[14] H. Jeongseok and S. W. Mclaughlin, \"Low-density parity-check codes over Gaussian channels with erasures,\" IEEE Transaction on Information Theory, vol. 49, no. 7, pp. 121-127, May 2003.","DOI":"10.1109\/TIT.2003.813480"},{"key":"ref14","unstructured":"[15] S. Y. Chung, \"On the construction of some capacity-approaching coding schemes,\" Ph.D. dissertation, Dept. Elect. Eng., Massachusetts Institute of Technology, Boston, USA, 2000."},{"key":"ref15","doi-asserted-by":"crossref","unstructured":"[16] F. Luan, J. H. Choi, and H. K. Jung \"A particle swarm optimization algorithm with novel expected fitness evaluation for robust optimization problems,\" IEEE Transactions on Magnetics, vol. 48, no. 2, pp. 331-334, Feb. 2012.","DOI":"10.1109\/TMAG.2011.2173753"},{"key":"ref16","unstructured":"[17] X. J. Xiao, C. H. Yang, and W. H. Gui, \"Particle swarm optimization algorithm with variable random function,\" presented at the Control Conference(CCC), Yantai, China, Feb. 2011, pp. 5408\u20135412."},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"[18] B. G. Valdes and G. Allan, \"Sparse array optimization using simulated annealing and compressed sensing for near-field millimeter wave imaging,\" IEEE Transactions on Antennas and Propagation, vol. 62, no. 4, pp. 1716-1722, Apr. 2014.","DOI":"10.1109\/TAP.2013.2290801"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"[19] S. Bandyopadhyay, S. Saha, U. Maulik, and K. Deb, \"A simulated annealing-based multi-objective optimization algorithm: AMOSA,\" IEEE Transactions on Evolutionary Computation, vol. 12, no. 3, pp. 269-283, Feb. 2008.","DOI":"10.1109\/TEVC.2007.900837"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2016\/0524\/20160524042742565.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T04:24:21Z","timestamp":1568607861000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=161&id=975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":19,"URL":"https:\/\/doi.org\/10.12720\/jcm.11.5.455-461","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2016]]}}}