乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:14:10Z","timestamp":1648775650192},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T00:00:00Z","timestamp":1430352000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/s13638-015-0351-0","type":"journal-article","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T07:07:00Z","timestamp":1430291220000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Irregular 8PSK mapping for variable length codes with small blocks in a BICM-ID system"],"prefix":"10.1186","volume":"2015","author":[{"given":"Jing","family":"Dai","sequence":"first","affiliation":[]},{"given":"Can","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shaoshuai","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Hou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"issue":"234","key":"351_CR1","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/26.380026","volume":"43","author":"Y Takishima","year":"1995","unstructured":"Y Takishima, M Wada, H Murakami, Reversible variable length codes. IEEE Trans. Commun. 43(234), 158\u2013162 (1995).","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"351_CR2","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/LCOMM.2004.837645","volume":"8","author":"J Wang","year":"2004","unstructured":"J Wang, L-L Yang, L Hanzo, Iterative construction of reversible variable-length codes and variable-length error-correcting codes. IEEE Commun. Lett. 8(11), 671\u2013673 (2004).","journal-title":"IEEE Commun. Lett."},{"issue":"11","key":"351_CR3","doi-asserted-by":"publisher","first-page":"3175","DOI":"10.1109\/TCOMM.2010.091710.0901872","volume":"58","author":"Y-M Huang","year":"2010","unstructured":"Y-M Huang, T-Y Wu, YS Han, An A*-based algorithm for constructing reversible variable length codes with minimum average codeword length. IEEE Trans. Commun. 58(11), 3175\u20133185 (2010).","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"351_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1049\/ip-com:20000407","volume":"147","author":"V Buttigieg","year":"2000","unstructured":"V Buttigieg, PG Farrell, Variable-length error-correcting codes. IEE Proc. Commun. 147(4), 211\u2013215 (2000).","journal-title":"IEE Proc. Commun."},{"issue":"10","key":"351_CR5","doi-asserted-by":"publisher","first-page":"3080","DOI":"10.1109\/TCOMM.2012.072412.110706","volume":"60","author":"A Diallo","year":"2012","unstructured":"A Diallo, C Weidmann, M Kieffer, New free distance bounds and design techniques for joint source-channel variable-length codes. IEEE Trans. Commun. 60(10), 3080\u20133090 (2012).","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"351_CR6","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","volume":"20","author":"L Bahl","year":"1974","unstructured":"L Bahl, J Cocke, F Jelinek, J Raviv, Optimal decoding of linear codes for minimizing symbol error rate (corresp.)IEEE Trans. Inform. Theory. 20(2), 284\u2013287 (1974).","journal-title":"IEEE Trans. Inform. Theory."},{"key":"351_CR7","unstructured":"VB Balakirsky, in Proceedings of IEEE International Symposium on Information Theory (ISIT \u201997): June-July 1997. Joint source-channel coding with variable length codes (Ulm, Germany, 1997), p. 419."},{"key":"351_CR8","unstructured":"R Bauer, J Hagenauer, in Proceedings of the 3rd ITG Conference on Source and Channel Coding (CSCC \u201900): January 2000. Symbol-by-symbol MAP decoding of variable length codes (Munich, Germany, 2000), pp. 111\u2013116."},{"issue":"4","key":"351_CR9","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1109\/TWC.2008.060891","volume":"7","author":"RG Maunder","year":"2008","unstructured":"RG Maunder, J Wang, SX Ng, L-L Yang, L Hanzo, On the performance and complexity of irregular variable length codes for near-capacity joint source and channel coding. IEEE Trans. Wireless Commun. 7(4), 1338\u20131347 (2008).","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"6","key":"351_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/4234.649929","volume":"1","author":"X Li","year":"1997","unstructured":"X Li, JA Ritcey, Bit-interleaved coded modulation with iterative decoding. IEEE Commun. Lett. 1(6), 169\u2013171 (1997).","journal-title":"IEEE Commun. Lett."},{"issue":"10","key":"351_CR11","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1109\/26.957394","volume":"49","author":"S ten Brink","year":"2001","unstructured":"S ten Brink, Convergence behavior of iteratively decoded parallel concatenated codes. IEEE Trans. Commun. 49(10), 1727\u20131737 (2001).","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"351_CR12","doi-asserted-by":"publisher","first-page":"2657","DOI":"10.1109\/TIT.2004.836693","volume":"50","author":"A Ashikhmin","year":"2004","unstructured":"A Ashikhmin, G Kramer, S ten Brink, Extrinsic information transfer functions: model and erasure channel properties. IEEE Trans. Inform. Theory. 50(11), 2657\u20132673 (2004).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"351_CR13","unstructured":"F Schreckenbach, N G\u00f6rtz, J Hagenauer, G Bauch, in Proc. IEEE GLOBECOM 2003. Optimized symbol mappings for bit-interleaved coded modulation with iterative decoding (San Francisco, CA, 2003), pp. 3316\u20133320."},{"issue":"11","key":"351_CR14","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/LCOMM.2010.093010.101049","volume":"14","author":"Z Yang","year":"2010","unstructured":"Z Yang, Q Xie, K Peng, J Song, Labeling optimization for BICM-ID systems. IEEE Commun. Lett. 14(11), 1047\u20131049 (2010).","journal-title":"IEEE Commun. Lett."},{"key":"351_CR15","unstructured":"M T\u00fcchler, J Hagenauer, in Proc. 2002 Conf. Information Sciences and Systems. EXIT charts of irregular codes (Princeton, NJ, 2002), pp. 748\u2013753."},{"issue":"2","key":"351_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/ett.1107","volume":"17","author":"F Schreckenbach","year":"2006","unstructured":"F Schreckenbach, G Bauch, Bit-interleaved coded irregular modulation. European Trans. Telecommun. 17(2), 269\u2013282 (2006).","journal-title":"European Trans. Telecommun."},{"issue":"1","key":"351_CR17","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/T-WC.2009.071202","volume":"8","author":"R Tee","year":"2009","unstructured":"R Tee, RG Maunder, L Hanzo, EXIT-chart aided near-capacity irregular bit-interleaved coded modulation design. IEEE Trans. Wireless Commun. 8(1), 32\u201337 (2009).","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"1","key":"351_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1186\/1687-1499-2014-31","volume":"2014","author":"C Cheng","year":"2014","unstructured":"C Cheng, G Tu, C Zhang, J Dai, Optimization of irregular mapping for error floor removed bit-interleaved coded modulation with iterative decoding and 8psk. EURASIP J. Wireless Commun. Netw. 2014(1), 31\u201345 (2014).","journal-title":"EURASIP J. Wireless Commun. Netw."},{"issue":"2","key":"351_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/TCOMM.2003.822697","volume":"52","author":"M T\u00fcchler","year":"2004","unstructured":"M T\u00fcchler, Design of serially concatenated systems depending on the block length. IEEE Trans. Commun. 52(2), 209\u2013218 (2004).","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"351_CR20","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1109\/TIT.2008.2011506","volume":"55","author":"F Br\u00e4nnstr\u00f6m","year":"2009","unstructured":"F Br\u00e4nnstr\u00f6m, LK Rasmussen, Classification of unique mappings for 8PSK based on bit-wise distance spectra. IEEE Trans. Inform. Theory. 55(3), 1131\u20131145 (2009).","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"11","key":"351_CR21","doi-asserted-by":"publisher","first-page":"3174","DOI":"10.1109\/TWC.2006.05163","volume":"5","author":"S Pfletschinger","year":"2006","unstructured":"S Pfletschinger, F Sanzi, Error floor removal for bit-interleaved coded modulation with iterative detection. IEEE Trans. Wireless Commun. 5(11), 3174\u20133181 (2006).","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"2","key":"351_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"S Lloyd, Least squares quantization in PCM. IEEE Trans. Info. Theory. 28(2), 129\u2013137 (1982).","journal-title":"IEEE Trans. Info. Theory."},{"key":"351_CR23","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"VI Levenshtein, Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady. 10, 707 (1966).","journal-title":"Soviet Physics Doklady."},{"issue":"2","key":"351_CR24","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TWC.2004.842966","volume":"4","author":"J Tan","year":"2005","unstructured":"J Tan, G St\u00fcber, Analysis and design of symbol mappers for iteratively decoded BICM. IEEE Trans. Wireless Commun. 4(2), 662\u2013672 (2005).","journal-title":"IEEE Trans. Wireless Commun."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-015-0351-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0351-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0351-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0351-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T22:42:21Z","timestamp":1553640141000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-015-0351-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,30]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["351"],"URL":"https:\/\/doi.org\/10.1186\/s13638-015-0351-0","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,30]]},"assertion":[{"value":"15 October 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"123"}}