{"id":"https://openalex.org/W2886786317","doi":"https://doi.org/10.1109/isit.2018.8437588","title":"Improved Redundant Parity-Check Based BP Decoding of LDPC Codes","display_name":"Improved Redundant Parity-Check Based BP Decoding of LDPC Codes","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886786317","doi":"https://doi.org/10.1109/isit.2018.8437588","mag":"2886786317"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437588","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","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/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":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":true,"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":"education","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":"middle","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":"education","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"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065207459","display_name":"Yauhen Yakimenka","orcid":"https://orcid.org/0000-0003-3030-2336"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Yauhen Yakimenka","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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5018999589"],"corresponding_institution_ids":["https://openalex.org/I56085075"],"apc_list":null,"apc_paid":null,"fwci":0.5536,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70137608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"40","issue":null,"first_page":"1161","last_page":"1165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9995999932289124,"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.9995999932289124,"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.9973000288009644,"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/T11873","display_name":"PAPR reduction in OFDM","score":0.9685999751091003,"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.8538863062858582},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8132327795028687},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.6687401533126831},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6171010136604309},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5882186889648438},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.5699912309646606},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5515952110290527},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.479645311832428},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.47066840529441833},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4696696698665619},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.44797414541244507},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.43151426315307617},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.3345608115196228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33167147636413574},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32596355676651},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.29347050189971924},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.22769030928611755},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17054754495620728},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09709316492080688}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8538863062858582},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8132327795028687},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.6687401533126831},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6171010136604309},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5882186889648438},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.5699912309646606},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5515952110290527},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.479645311832428},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.47066840529441833},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4696696698665619},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.44797414541244507},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.43151426315307617},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.3345608115196228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33167147636413574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32596355676651},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.29347050189971924},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.22769030928611755},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17054754495620728},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09709316492080688},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437588","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1533861979","https://openalex.org/W1688268837","https://openalex.org/W2105894282","https://openalex.org/W2115995841","https://openalex.org/W2140227657","https://openalex.org/W2201739330","https://openalex.org/W2743637348","https://openalex.org/W2744698717","https://openalex.org/W2963483034","https://openalex.org/W2963513394","https://openalex.org/W3100130925","https://openalex.org/W4300188436","https://openalex.org/W6631682735"],"related_works":["https://openalex.org/W2028976748","https://openalex.org/W2085052822","https://openalex.org/W2160839632","https://openalex.org/W2118148379","https://openalex.org/W4210406383","https://openalex.org/W4303471944","https://openalex.org/W2744658369","https://openalex.org/W2535079629","https://openalex.org/W2976134719","https://openalex.org/W2110262961"],"abstract_inverted_index":{"A":[0],"new":[1,30,74],"decoding":[2,62,83],"algorithm":[3,14,36,67],"for":[4,47,51,57],"LDPC":[5],"codes":[6],"on":[7,17,76],"the":[8,18,34,38,41,61,66,70,77,81,86],"AWGN":[9],"channel":[10],"is":[11,15,37],"proposed.":[12],"The":[13,29],"based":[16],"idea":[19],"of":[20,40,44,65,80],"using":[21],"redundant":[22,90],"parity":[23,45],"checks":[24,46],"and":[25],"additional":[26],"variable":[27,53],"nodes.":[28,54],"key":[31],"element":[32],"in":[33,60],"proposed":[35],"use":[39],"orthogonal":[42],"subsets":[43],"computing":[48],"soft":[49],"decisions":[50],"different":[52],"This":[55],"allows":[56],"significant":[58],"improvement":[59],"error":[63,78],"performance":[64,79],"compared":[68],"to":[69,85],"known":[71],"counterparts.":[72],"Furthermore,":[73],"bounds":[75],"BP":[82],"applied":[84],"parity-check":[87],"matrices":[88],"with":[89],"parity-checks":[91],"are":[92],"obtained.":[93]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
