乐胖代购免代理版

{"id":"https://openalex.org/W2976027294","doi":"https://doi.org/10.1109/isit.2019.8849632","title":"AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes","display_name":"AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2976027294","doi":"https://doi.org/10.1109/isit.2019.8849632","mag":"2976027294"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849632","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5018999589","display_name":"Irina E. Bocharova","orcid":"https://orcid.org/0000-0002-6460-4626"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"funder","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Irina E. Bocharova","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088880021","display_name":"Boris D. Kudryashov","orcid":"https://orcid.org/0000-0002-5865-5283"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"funder","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Boris D. Kudryashov","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048122752","display_name":"Vitaly Skachek","orcid":"https://orcid.org/0000-0002-0626-2437"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"funder","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Vitaly Skachek","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.197,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.236346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":61,"max":69},"biblio":{"volume":"40","issue":null,"first_page":"56","last_page":"60"},"is_retracted":false,"is_paratext":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.9971,"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.9914,"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/binary-erasure-channel","display_name":"Binary erasure channel","score":0.64462304},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.64063805},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.46711907}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.93328404},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.64462304},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.64063805},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.5796688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5745827},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.52547157},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.46711907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45825827},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4265243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3998707},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.36077535},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.34495184},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.19640967},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.19125453},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.13432765}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849632","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W1536120499","https://openalex.org/W1578469290","https://openalex.org/W1973712217","https://openalex.org/W1991921359","https://openalex.org/W2020772694","https://openalex.org/W2104345270","https://openalex.org/W2105894282","https://openalex.org/W2106682188","https://openalex.org/W2141836583","https://openalex.org/W2886786317","https://openalex.org/W2963149330","https://openalex.org/W2963513394"],"related_works":["https://openalex.org/W4386075075","https://openalex.org/W2808439818","https://openalex.org/W2351144917","https://openalex.org/W2156055959","https://openalex.org/W2150639697","https://openalex.org/W2126464345","https://openalex.org/W2090897912","https://openalex.org/W2065071381","https://openalex.org/W1968533815","https://openalex.org/W1525070854"],"abstract_inverted_index":{"One":[0],"of":[1,14,40,68,118,131,135,144,158],"the":[2,8,29,36,41,48,65,69,74,96,109,124,154,164],"most":[3],"efficient":[4,93],"approaches":[5],"to":[6,35,91,114,153],"improving":[7],"frame":[9],"error":[10],"rate":[11],"(FER)":[12],"performance":[13,67],"low-density":[15],"parity-check":[16,38],"(LDPC)":[17],"codes":[18,147,161],"is":[19,44,89,112,127,148,151],"based":[20],"on":[21,73],"adding":[22,85],"both":[23,95],"auxiliary":[24],"variable":[25],"nodes":[26],"(AVN)":[27],"and":[28,98],"corresponding":[30],"redundant":[31,87],"parity":[32],"checks":[33],"(RPC)":[34],"binary":[37,75],"matrices":[39,134,157],"code.":[42],"It":[43],"known":[45,90],"that":[46],"for":[47,61,94],"LDPC":[49,138,146,160],"codes,":[50],"whose":[51],"Tanner":[52],"graphs":[53],"contain":[54],"length":[55,119],"four":[56],"cycles,":[57],"this":[58,106],"technique":[59,82,126],"allows":[60],"substantial":[62],"improvement":[63],"in":[64,129],"FER":[66],"belief-propagation":[70],"(BP)":[71],"decoding":[72,143],"erasure":[76],"channel":[77],"(BEC)":[78],"channel.":[79],"The":[80],"AVN-based":[81,110,125],"followed":[83],"by":[84,163],"orthogonal":[86],"parity-checks":[88],"be":[92],"BEC":[97],"additive":[99],"white":[100],"Gaussian":[101],"noise":[102],"(AWGN)":[103],"channels.":[104],"In":[105],"paper,":[107],"firstly,":[108],"approach":[111],"generalized":[113],"efficiently":[115],"removing":[116],"cycles":[117],"larger":[120],"than":[121],"four.":[122],"Secondly,":[123],"reformulated":[128],"terms":[130],"labeled":[132,155],"base":[133,156],"quasi-cyclic":[136],"(QC)":[137],"codes.":[139],"An":[140],"improved":[141],"iterative":[142],"QC":[145,159],"proposed,":[149],"which":[150],"applied":[152],"extended":[162],"AVN-RPC":[165],"technique.":[166]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2976027294","counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-04-24T17:01:09.853119","created_date":"2019-10-03"}