{"id":"https://openalex.org/W2156575599","doi":"https://doi.org/10.1109/isit.2004.1365410","title":"Designing good LDPC codes for markov-modulated channels","display_name":"Designing good LDPC codes for markov-modulated channels","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2156575599","doi":"https://doi.org/10.1109/isit.2004.1365410","mag":"2156575599"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365410","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046532019","display_name":"Andrew W. Eckford","orcid":"https://orcid.org/0000-0002-9808-1229"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A.W. Eckford","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077846751","display_name":"Frank R. Kschischang","orcid":"https://orcid.org/0000-0002-4274-1785"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"F.R. Kschischang","raw_affiliation_strings":["The E. S. Rogers Sr. Department of ECE, University of Toronto, Toronto, ONT, Canada"],"affiliations":[{"raw_affiliation_string":"The E. S. Rogers Sr. Department of ECE, University of Toronto, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113120949","display_name":"S. Pasupathy","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S. Pasupathy","raw_affiliation_strings":["The E. S. Rogers Sr. Department of ECE, University of Toronto, Toronto, ONT, Canada"],"affiliations":[{"raw_affiliation_string":"The E. S. Rogers Sr. Department of ECE, University of Toronto, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046532019"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":1.2464,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84829238,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"373","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7097357511520386},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7004095315933228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6532602310180664},{"id":"https://openalex.org/keywords/precomputation","display_name":"Precomputation","score":0.588219404220581},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.556032121181488},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.546312689781189},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.477277934551239},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.47205525636672974},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.46693840622901917},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.4349464178085327},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4325970411300659},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.35802969336509705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27633699774742126},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12172561883926392}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7097357511520386},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7004095315933228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6532602310180664},{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.588219404220581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.556032121181488},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.546312689781189},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.477277934551239},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.47205525636672974},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.46693840622901917},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.4349464178085327},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4325970411300659},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.35802969336509705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27633699774742126},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12172561883926392},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2004.1365410","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.981.8375","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.981.8375","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://wiki.eecs.yorku.ca/user/aeckford/_media/ekp-isit04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2065468500","https://openalex.org/W2137717853","https://openalex.org/W2148095386"],"related_works":["https://openalex.org/W2169710030","https://openalex.org/W2147429396","https://openalex.org/W2126543779","https://openalex.org/W2623918504","https://openalex.org/W2957709805","https://openalex.org/W2916248738","https://openalex.org/W1968720239","https://openalex.org/W2622922565","https://openalex.org/W2100531868","https://openalex.org/W2121747124"],"abstract_inverted_index":{"We":[0,20,38],"present":[1,40],"a":[2,22],"reduced-complexity":[3],"approximate":[4],"density":[5],"evolution":[6],"scheme":[7],"that":[8],"is":[9,27,36],"particularly":[10],"suitable":[11],"for":[12],"Markov-modulated":[13,70],"channels,":[14],"based":[15],"on":[16],"the":[17,30,46,51],"semiGaussian":[18],"approximation.":[19],"propose":[21],"design":[23,61],"algorithm":[24],"whose":[25],"complexity":[26],"comparable":[28],"to":[29,67],"memoryless":[31],"case,":[32],"assuming":[33],"unlimited":[34],"precomputation":[35],"allowed.":[37],"also":[39],"degree":[41],"sequences":[42],"representing":[43],"some":[44],"of":[45],"best":[47],"known":[48],"codes":[49],"in":[50],"GE":[52],"channel":[53],"which":[54],"were":[55],"designed":[56],"using":[57],"this":[58],"technique.":[59],"This":[60],"tool":[62],"can":[63],"be":[64],"easily":[65],"extended":[66],"more":[68],"complicated":[69],"channels":[71]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}