{"id":"https://openalex.org/W2134430085","doi":"https://doi.org/10.1109/isit.2012.6284047","title":"Jar decoding: LDPC coding theorems for binary input memoryless channels","display_name":"Jar decoding: LDPC coding theorems for binary input memoryless channels","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2134430085","doi":"https://doi.org/10.1109/isit.2012.6284047","mag":"2134430085"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6284047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory 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/A5080794633","display_name":"En\u2010hui Yang","orcid":"https://orcid.org/0000-0003-1504-7584"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"En-Hui Yang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ONT, Canada","Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005763368","display_name":"Jin Meng","orcid":"https://orcid.org/0000-0003-2657-8647"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jin Meng","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ONT, Canada","Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080794633"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19616614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2861","last_page":"2865"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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.9966999888420105,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8583207130432129},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.846329927444458},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7716076374053955},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6388002634048462},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5051820874214172},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4807714819908142},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.48058652877807617},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4717952609062195},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.45240339636802673},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4430184066295624},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4217183291912079},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4194387197494507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4157378673553467},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3903816342353821},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35969486832618713},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3422299027442932},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21919625997543335},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.19002053141593933},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.12160545587539673},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12147125601768494}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8583207130432129},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.846329927444458},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7716076374053955},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6388002634048462},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5051820874214172},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4807714819908142},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.48058652877807617},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4717952609062195},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.45240339636802673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4430184066295624},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4217183291912079},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4194387197494507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4157378673553467},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3903816342353821},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35969486832618713},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3422299027442932},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21919625997543335},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.19002053141593933},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.12160545587539673},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12147125601768494}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2012.6284047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W2011377472","https://openalex.org/W2114449874","https://openalex.org/W2115228681","https://openalex.org/W2133068391","https://openalex.org/W2169732368","https://openalex.org/W4300188436","https://openalex.org/W6653173541"],"related_works":["https://openalex.org/W2028976748","https://openalex.org/W2085052822","https://openalex.org/W2099880008","https://openalex.org/W4210406383","https://openalex.org/W2744658369","https://openalex.org/W4302175014","https://openalex.org/W4303471944","https://openalex.org/W2160839632","https://openalex.org/W2045996052","https://openalex.org/W2118148379"],"abstract_inverted_index":{"Recently,":[0],"a":[1,16,22,82,164,177],"new":[2,95],"decoding":[3,7,146,152],"rule":[4],"called":[5,21],"jar":[6,50,65,145,168],"was":[8],"proposed,":[9],"under":[10,64],"which":[11],"the":[12,28,49,52,55,67,112,131,167],"decoder":[13],"first":[14],"forms":[15],"set":[17],"of":[18,25,54,69,120,158],"suitable":[19],"size,":[20],"jar,":[23],"consisting":[24],"sequences":[26],"from":[27,48,166],"channel":[29,125],"input":[30,123,128],"alphabet":[31],"considered":[32],"to":[33,37,80,161],"be":[34,101,154],"closely":[35],"related":[36],"y":[38],"<sup":[39],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[40],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[41],",":[42],"and":[43,89,94,147],"then":[44],"takes":[45],"any":[46,121],"codeword":[47,165],"as":[51,156],"estimate":[53],"transmitted":[56],"codeword.":[57,178],"In":[58],"this":[59],"paper,":[60],"we":[61],"show":[62],"that":[63,107],"decoding,":[66,93,149],"analysis":[68],"low":[70],"density":[71],"parity":[72],"check":[73],"(LDPC)":[74],"codes":[75,109,171],"is":[76,105,136],"much":[77],"easier":[78],"compared":[79],"maximum":[81,86],"posteriori":[83],"(MAP)":[84],"or":[85],"likelihood":[87],"(ML)":[88],"Belief":[90],"Propagation":[91],"(BP)":[92],"general":[96],"LDPC":[97,108,170],"coding":[98],"theorems":[99],"can":[100,110,153],"established.":[102],"Specifically,":[103],"it":[104,173],"proved":[106],"approach":[111],"mutual":[113],"information,":[114],"with":[115,126],"diminishing":[116],"bit":[117],"error":[118],"probability,":[119],"binary":[122],"memoryless":[124],"uniform":[127],"distribution":[129],"when":[130,172],"average":[132],"variable":[133],"node":[134],"degree":[135],"large.":[137],"Moreover,":[138],"simulation":[139],"shows":[140],"an":[141],"interesting":[142],"connection":[143],"between":[144],"BP":[148,151],"i.e.,":[150],"regarded":[155],"one":[157],"many":[159],"ways":[160],"pick":[162],"up":[163],"for":[169],"succeeds":[174],"in":[175],"outputting":[176]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}