{"id":"https://openalex.org/W2143992380","doi":"https://doi.org/10.1109/isit.2010.5513628","title":"Algebraic constructions of graph-based nested codes from protographs","display_name":"Algebraic constructions of graph-based nested codes from protographs","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2143992380","doi":"https://doi.org/10.1109/isit.2010.5513628","mag":"2143992380"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513628","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 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/A5072790914","display_name":"Christine A. Kelley","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christine A. Kelley","raw_affiliation_strings":["Department of Mathematics, University of Nebraska, Lincoln, Lincolnshire, NE, USA","Department of Mathematics, University of Nebraska-Lincoln, 68588, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Department of Mathematics, University of Nebraska-Lincoln, 68588, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021311010","display_name":"J\u00f6rg Kliewer","orcid":"https://orcid.org/0000-0003-0942-8006"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]},{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jorg Kliewer","raw_affiliation_strings":["Department of Mathematics, University of Nebraska, Lincoln, Lincolnshire, NE, USA","Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las cruces, 88003, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las cruces, 88003, USA","institution_ids":["https://openalex.org/I10052268"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1186,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.80944429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"829","last_page":"833"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9997000098228455,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9990000128746033,"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/T12029","display_name":"DNA and Biological Computing","score":0.9951000213623047,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6929354667663574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6198630332946777},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4967647194862366},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.46663743257522583},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4532058537006378},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.44365033507347107},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4351494014263153},{"id":"https://openalex.org/keywords/algebraic-structure","display_name":"Algebraic structure","score":0.41815757751464844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.365540087223053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30211174488067627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3013054132461548},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.20315459370613098}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6929354667663574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6198630332946777},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4967647194862366},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.46663743257522583},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4532058537006378},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.44365033507347107},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4351494014263153},{"id":"https://openalex.org/C182419690","wikidata":"https://www.wikidata.org/wiki/Q205464","display_name":"Algebraic structure","level":2,"score":0.41815757751464844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.365540087223053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30211174488067627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3013054132461548},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.20315459370613098},{"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/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513628","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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":18,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1558273801","https://openalex.org/W1571565904","https://openalex.org/W2071304218","https://openalex.org/W2106572337","https://openalex.org/W2107933947","https://openalex.org/W2111992817","https://openalex.org/W2113362900","https://openalex.org/W2114468914","https://openalex.org/W2117904894","https://openalex.org/W2128765501","https://openalex.org/W2143579137","https://openalex.org/W2147776616","https://openalex.org/W2150412388","https://openalex.org/W2158562094","https://openalex.org/W2169413533","https://openalex.org/W3169111758","https://openalex.org/W6634121476"],"related_works":["https://openalex.org/W2169710030","https://openalex.org/W2147429396","https://openalex.org/W2126543779","https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2540115800","https://openalex.org/W2167713507","https://openalex.org/W2034110706","https://openalex.org/W2209506458"],"abstract_inverted_index":{"Nested":[0],"codes":[1,41,60,82,129],"have":[2,42,83],"been":[3,43,84],"employed":[4],"in":[5,25,30,35,49,124],"a":[6,13],"large":[7],"number":[8],"of":[9,16,28,57,81,92,102,110,127,133],"communication":[10],"applications":[11],"as":[12],"specific":[14],"case":[15],"superposition":[17],"codes,":[18],"for":[19,46,61],"example":[20],"to":[21],"implement":[22],"binning":[23],"schemes":[24],"the":[26,55,75,108,125],"presence":[27],"noise,":[29],"joint":[31,62],"network-channel":[32],"coding,":[33],"or":[34],"physical-layer":[36],"secrecy.":[37],"Whereas":[38],"nested":[39,58,128],"lattice":[40],"proposed":[44,85],"recently":[45],"continuous-input":[47],"channels,":[48],"this":[50,103,114],"paper":[51,115],"we":[52,116],"focus":[53],"on":[54,67,89],"construction":[56,126],"linear":[59],"channel-network":[63],"coding":[64],"problems":[65],"based":[66,88],"algebraic":[68,100,131],"photograph":[69],"LDPC":[70],"codes.":[71],"In":[72,113],"particular,":[73],"over":[74],"past":[76],"few":[77],"years":[78],"several":[79],"constructions":[80],"that":[86],"are":[87],"random":[90],"lifts":[91,132],"suitably":[93],"chosen":[94],"base":[95],"graphs.":[96,112,134],"More":[97],"recently,":[98],"an":[99],"analog":[101],"approach":[104],"was":[105],"introduced":[106],"using":[107],"theory":[109],"voltage":[111],"illustrate":[117],"how":[118],"these":[119],"methods":[120],"can":[121],"be":[122],"used":[123],"from":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}