{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:20:52Z","timestamp":1725754852072},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1109\/itwitwn.2007.4318057","type":"proceedings-article","created":{"date-parts":[[2007,9,24]],"date-time":"2007-09-24T14:51:32Z","timestamp":1190645492000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["On the Effects of Pseudo-Codewords on Independent Rayleigh Flat-Fading Channels"],"prefix":"10.1109","author":[{"given":"Eirik","family":"Rosnes","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"ref11","article-title":"Pseudocodewords of Tanner graphs","author":"kelly","year":"2005","journal-title":"IEEE Trans Inform Theory"},{"key":"ref12","article-title":"On the connection between finite graph covers, pseudo-codewords, and linear programming decoding of turbo codes","author":"rosnes","year":"2006","journal-title":"Proc 5th Int Symp Turbo Codes and Related Topics"},{"article-title":"Decoding error-correcting codes via linear programming","year":"2003","author":"feldman","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557664"},{"key":"ref15","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc Int Symp Commun Theory Appl"},{"key":"ref16","article-title":"Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes","author":"samarandache","year":"2006","journal-title":"IEEE Trans Inform Theory"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref17"},{"key":"ref18","article-title":"Adaptive methods for linear programming decoding","author":"taghavi","year":"2007","journal-title":"IEEE Trans Inform Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0165-3_5"},{"key":"ref7","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","author":"vontobel","year":"2005","journal-title":"IEEE Trans Inform Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181948"}],"event":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","start":{"date-parts":[[2007,7,1]]},"location":"Solstrand","end":{"date-parts":[[2007,7,6]]}},"container-title":["2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4318012\/4318013\/04318057.pdf?arnumber=4318057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T19:25:57Z","timestamp":1529004357000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4318057\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/itwitwn.2007.4318057","relation":{},"subject":[],"published":{"date-parts":[[2007,7]]}}}