{"id":"https://openalex.org/W2013632064","doi":"https://doi.org/10.1109/isit.2007.4557138","title":"Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration","display_name":"Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2013632064","doi":"https://doi.org/10.1109/isit.2007.4557138","mag":"2013632064"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","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/A5016053889","display_name":"Hua Xiao","orcid":"https://orcid.org/0000-0002-2831-0436"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Hua Xiao","raw_affiliation_strings":["SCE Department, Carleton University, Ottawa, ONT, Canada","Carleton University, Ottawa"],"affiliations":[{"raw_affiliation_string":"SCE Department, Carleton University, Ottawa, ONT, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"Carleton University, Ottawa","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046274917","display_name":"Amir H. Banihashemi","orcid":"https://orcid.org/0000-0003-0685-5256"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Amir H. Banihashemi","raw_affiliation_strings":["SCE Department, Carleton University, Ottawa, ONT, Canada","Carleton University, Ottawa"],"affiliations":[{"raw_affiliation_string":"SCE Department, Carleton University, Ottawa, ONT, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"Carleton University, Ottawa","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016053889"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":0.9626,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77668225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"48","issue":null,"first_page":"1551","last_page":"1555"},"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.9990000128746033,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9143485426902771},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7029599547386169},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6511105298995972},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5989872217178345},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.54953932762146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5436922311782837},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4893145263195038},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.4565008580684662},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.44074028730392456},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4384867548942566},{"id":"https://openalex.org/keywords/word-error-rate","display_name":"Word error rate","score":0.43089649081230164},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3329876661300659},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31404048204421997},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.21448326110839844},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14075899124145508}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9143485426902771},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7029599547386169},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6511105298995972},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5989872217178345},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.54953932762146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5436922311782837},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4893145263195038},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.4565008580684662},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.44074028730392456},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4384867548942566},{"id":"https://openalex.org/C40969351","wikidata":"https://www.wikidata.org/wiki/Q3516228","display_name":"Word error rate","level":2,"score":0.43089649081230164},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3329876661300659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31404048204421997},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.21448326110839844},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14075899124145508},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2007.4557138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1484692004","https://openalex.org/W1508654922","https://openalex.org/W1772907943","https://openalex.org/W1964402820","https://openalex.org/W2095882513","https://openalex.org/W2106664865","https://openalex.org/W2127204517","https://openalex.org/W2141886216","https://openalex.org/W2152474312","https://openalex.org/W2157974112","https://openalex.org/W2161514549","https://openalex.org/W4285719527","https://openalex.org/W6628810906","https://openalex.org/W6638033105","https://openalex.org/W6683571063"],"related_works":["https://openalex.org/W1968533815","https://openalex.org/W2808439818","https://openalex.org/W2126464345","https://openalex.org/W2150639697","https://openalex.org/W2351144917","https://openalex.org/W2090897912","https://openalex.org/W2142415334","https://openalex.org/W1526609637","https://openalex.org/W2152494507","https://openalex.org/W2083917443"],"abstract_inverted_index":{"The":[0,60],"performance":[1],"of":[2,25,52,62,96,112,155,178,188],"low-density":[3],"parity-check":[4],"(LDPC)":[5],"codes":[6,183],"decoded":[7,184],"by":[8,34,86,109,185],"hard-decision":[9,189],"iterative":[10,190],"decoding":[11,191],"algorithms":[12],"can":[13,163],"be":[14,32],"accurately":[15,164],"estimated":[16],"if":[17],"the":[18,22,26,35,49,74,90,100,106,123,134,145,160,167,173],"weight":[19,56],"J":[20,41,83],"and":[21,42,84,88,172,180],"number":[23,154],"|Ej|":[24,85],"smallest":[27],"error":[28,53,91,124,135,169,175],"patterns":[29,54,92],"that":[30,93,142,159],"cannot":[31],"corrected":[33],"decoder":[36],"are":[37,94,150],"known.":[38],"To":[39,132],"obtain":[40,133],"|Ej|,":[43],"one":[44],"would":[45],"need":[46],"to":[47,115,121],"perform":[48],"direct":[50,116],"enumeration":[51,63],"with":[55,66],"i":[57],"les":[58],"J.":[59],"complexity":[61,108],"increases":[64],"exponentially":[65],"J,":[67],"essentially":[68],"as":[69,147],"nJ,":[70],"where":[71],"n":[72],"is":[73],"code":[75],"block":[76],"length.":[77],"In":[78],"this":[79],"paper,":[80],"we":[81,138,157],"approximate":[82],"enumerating":[87],"testing":[89],"subsets":[95],"short":[97],"cycles":[98,149],"in":[99],"code's":[101],"Tanner":[102],"graph.":[103],"This":[104],"reduces":[105],"computational":[107],"several":[110],"orders":[111],"magnitude":[113],"compared":[114],"enumeration,":[117],"making":[118],"it":[119],"possible":[120],"estimate":[122,165],"rates":[125],"for":[126],"almost":[127],"any":[128],"practical":[129],"LDPC":[130,182],"code.":[131],"rate":[136,170,176],"estimates,":[137],"propose":[139],"an":[140],"algorithm":[141],"progressively":[143],"improves":[144],"estimates":[146],"larger":[148],"enumerated.":[151],"Through":[152],"a":[153,186],"examples,":[156],"demonstrate":[158],"proposed":[161],"method":[162],"both":[166],"bit":[168],"(BER)":[171],"frame":[174],"(FER)":[177],"regular":[179],"irregular":[181],"variety":[187],"algorithms.":[192]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}