{"id":"https://openalex.org/W2887634014","doi":"https://doi.org/10.1109/isit.2018.8437332","title":"Linear Rate-Compatible Codes with Degree-1 Extending Variable Nodes Under Iterative Decoding","display_name":"Linear Rate-Compatible Codes with Degree-1 Extending Variable Nodes Under Iterative Decoding","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2887634014","doi":"https://doi.org/10.1109/isit.2018.8437332","mag":"2887634014"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437332","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_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/A5110941585","display_name":"Sudarsan V. S. Ranganathan","orcid":null},"institutions":[],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudarsan V.S. Ranganathan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, California"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, California","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013185545","display_name":"Richard D. Wesel","orcid":"https://orcid.org/0000-0002-9139-8098"},"institutions":[],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard D. Wesel","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, California"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, California","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033923371","display_name":"D. Divsalar","orcid":"https://orcid.org/0000-0001-9176-3078"},"institutions":[{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dariush Divsalar","raw_affiliation_strings":["Jet Propulsion Laboratory, California Institute of Technology, Pasadena, California"],"affiliations":[{"raw_affiliation_string":"Jet Propulsion Laboratory, California Institute of Technology, Pasadena, California","institution_ids":["https://openalex.org/I1334627681"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.188,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":2,"citation_normalized_percentile":{"value":0.393629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":70,"max":74},"biblio":{"volume":null,"issue":null,"first_page":"1166","last_page":"1170"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Low-Density Parity-Check and Polar Codes","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":"Low-Density Parity-Check and Polar Codes","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":"Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing","score":0.9979,"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/T12029","display_name":"DNA-based Computing and Data Storage","score":0.9957,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/iterative-decoding","display_name":"Iterative Decoding","score":0.609307},{"id":"https://openalex.org/keywords/capacity-achieving-codes","display_name":"Capacity-Achieving Codes","score":0.575656},{"id":"https://openalex.org/keywords/ldpc-codes","display_name":"LDPC Codes","score":0.531251},{"id":"https://openalex.org/keywords/error-correcting-codes","display_name":"Error-Correcting Codes","score":0.52804},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.4953057},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4923464}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.82992923},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.78469837},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7185533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.61582136},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.5308911},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.4953057},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4923464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.478471},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45587438},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.44501364},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.41622674},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.28389034},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437332","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_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":17,"referenced_works":["https://openalex.org/W1896867467","https://openalex.org/W1999589899","https://openalex.org/W2012642489","https://openalex.org/W2115104320","https://openalex.org/W2128765501","https://openalex.org/W2129971925","https://openalex.org/W2133068391","https://openalex.org/W2144336593","https://openalex.org/W2150494733","https://openalex.org/W2169732368","https://openalex.org/W2296600582","https://openalex.org/W2963262593","https://openalex.org/W4229922087","https://openalex.org/W4256264271","https://openalex.org/W4300188436","https://openalex.org/W628021441","https://openalex.org/W91277888"],"related_works":["https://openalex.org/W4310544044","https://openalex.org/W2772956856","https://openalex.org/W2508865029","https://openalex.org/W2479327835","https://openalex.org/W2382404952","https://openalex.org/W2371861983","https://openalex.org/W2164777066","https://openalex.org/W2163036861","https://openalex.org/W2110972223","https://openalex.org/W2099132973"],"abstract_inverted_index":{"A":[0],"rate-compatible":[1],"(RC)":[2],"code":[3,20,56,195],"first":[4],"transmits":[5],"a":[6,48,83,123,158,192],"set":[7],"of":[8,36,53,71,78,87,89,96,150,160,199],"symbols":[9,16,31,40,52,88,140],"corresponding":[10],"to":[11,47,122,130],"the":[12,18,25,27,34,37,44,54,90,94,105,116,133,138,165,188,210],"highest":[13],"rate.":[14],"These":[15],"form":[17],"highest-rate":[19],"(HRC).":[21],"If":[22],"requested":[23],"by":[24,196],"receiver,":[26],"transmitter":[28],"subsequently":[29],"sends":[30],"that":[32,104,136,175],"lower":[33],"rate":[35],"code.":[38],"Additional":[39],"are":[41,57,141,157],"sent":[42],"until":[43],"decoder":[45],"decodes":[46],"codeword":[49],"or":[50],"all":[51],"RC":[55,61,181,194],"exhausted.":[58],"Consider":[59],"linear,":[60],"low-density":[62],"parity-check":[63],"(LDPC)":[64],"codes":[65,98,163,182],"constructed":[66],"using":[67,173,209],"extending":[68,166,177],"variable":[69,118,215],"nodes":[70,119],"degree":[72],"1.":[73],"That":[74],"is,":[75],"every":[76],"symbol":[77],"incremental":[79,214],"redundancy":[80],"(IR)":[81],"is":[82,127,183],"linear":[84],"combination":[85],"only":[86,113],"HRC.":[91],"We":[92,102,143],"study":[93],"convergence":[95,106],"such":[97],"under":[99,168],"iterative":[100,200],"decoding.":[101],"show":[103],"criterion":[107],"considered":[108],"after":[109],"each":[110],"iteration":[111],"need":[112,129],"check":[114],"whether":[115,132],"HRC":[117],"have":[120],"converged":[121],"codeword.":[124],"Specifically,":[125],"there":[126],"no":[128],"consider":[131],"parity":[134],"checks":[135],"generate":[137],"IR":[139],"satisfied.":[142],"substantiate":[144],"these":[145],"claims":[146],"with":[147,164],"simulation":[148],"results":[149],"protograph-based":[151],"raptor-like":[152],"LDPC":[153],"(PBRL)":[154],"codes,":[155],"which":[156],"family":[159],"protograph":[161,180,193],"RC-LDPC":[162],"structure":[167,178],"consideration.":[169],"Furthermore,":[170],"we":[171],"demonstrate":[172],"examples":[174,198],"this":[176],"for":[179,191,203,213],"not":[184],"very":[185],"far":[186],"from":[187],"optimal":[189,211],"extension":[190],"providing":[197],"decoding":[201],"thresholds":[202],"PBRL":[204],"protographs":[205,207],"and":[206],"extended":[208],"degrees":[212],"nodes.":[216]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2887634014","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2024-11-28T09:59:36.927225","created_date":"2018-08-22"}