{"id":"https://openalex.org/W2041158537","doi":"https://doi.org/10.1109/acssc.2013.6810673","title":"Efficiently encodable non-binary generalized LDPC codes","display_name":"Efficiently encodable non-binary generalized LDPC codes","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2041158537","doi":"https://doi.org/10.1109/acssc.2013.6810673","mag":"2041158537"},"language":"en","primary_location":{"id":"doi:10.1109/acssc.2013.6810673","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2013.6810673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Asilomar Conference on Signals, Systems and Computers","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/A5108507484","display_name":"Nicholas B. Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas B. Chang","raw_affiliation_strings":["Applied Communication Sciences, MIT Lincoln Laboratory, Red Bank, NJ","Applied Communication Sciences, 331 Newman Springs Road, Red Bank, NJ 07701"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Applied Communication Sciences, MIT Lincoln Laboratory, Red Bank, NJ","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"Applied Communication Sciences, 331 Newman Springs Road, Red Bank, NJ 07701","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015716777","display_name":"M. Kocic","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marko Kocic","raw_affiliation_strings":["MIT Lincoln Laboratory, Lexington, MA","MIT LINCOLN LABORATORY, 244 WOOD STREET, LEXINGTON,MA 02420"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"MIT LINCOLN LABORATORY, 244 WOOD STREET, LEXINGTON,MA 02420","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13497374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2079","last_page":"2083"},"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.9994000196456909,"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.9962999820709229,"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.8287340998649597},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6349393129348755},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6122716069221497},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5596992373466492},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5304023027420044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5130513906478882},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.49547040462493896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4854632019996643},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4636930227279663},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.45465683937072754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36895620822906494},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35037583112716675},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3318093419075012},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3265278935432434},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14798647165298462}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8287340998649597},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6349393129348755},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6122716069221497},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5596992373466492},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5304023027420044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5130513906478882},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.49547040462493896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4854632019996643},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4636930227279663},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.45465683937072754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36895620822906494},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35037583112716675},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3318093419075012},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3265278935432434},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14798647165298462}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acssc.2013.6810673","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2013.6810673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Asilomar Conference on Signals, Systems and Computers","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":14,"referenced_works":["https://openalex.org/W147465018","https://openalex.org/W2097900809","https://openalex.org/W2105006836","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2135764410","https://openalex.org/W2160455143","https://openalex.org/W2165821194","https://openalex.org/W2173776306","https://openalex.org/W2541842197","https://openalex.org/W2543591467","https://openalex.org/W2545404992","https://openalex.org/W4210992409","https://openalex.org/W6605892194"],"related_works":["https://openalex.org/W2015101254","https://openalex.org/W2150212378","https://openalex.org/W1851307089","https://openalex.org/W2127950068","https://openalex.org/W2209506458","https://openalex.org/W1580452828","https://openalex.org/W2383546851","https://openalex.org/W1996737726","https://openalex.org/W1917873986","https://openalex.org/W2118994295"],"abstract_inverted_index":{"This":[0],"writeup":[1],"examines":[2],"the":[3,32,49,66,117,137,155,163,172,218,221,233,248,253,273],"construction":[4],"and":[5,39,85,123,174,236],"performance":[6,41,173,244],"of":[7,52,116,120,147,157,177],"non-binary":[8,69,110,121,128,181,222,226,266],"generalized":[9],"low-density":[10,26],"parity-check":[11,27,50],"(GLDPC)":[12],"codes.":[13,64,126,141],"Recently,":[14],"binary":[15,78,104,124,139],"GLDPC":[16,46,105,111,125,129,140,148,178,192,223],"coding":[17,44,88,134,186,250],"techniques":[18],"have":[19,72,102,262],"been":[20,73],"shown":[21,74,195,242],"to":[22,75,98,113,170,196,231,277],"improve":[23],"upon":[24],"conventional":[25],"(LDPC)":[28],"codes":[29,47,71,112,130,149,179,183,224,228],"by":[30],"increasing":[31],"minimum":[33],"codeword":[34,83,164],"length,":[35],"reducing":[36],"error":[37,234],"floors,":[38],"improving":[40],"at":[42,184],"lower":[43,185],"rates.":[45,187],"replace":[48],"constraints":[51],"a":[53,145,190,198],"standard":[54],"LDPC":[55,70,79,122,182,201,227,267],"code":[56,193,202],"with":[57,150,162,217,229],"stronger":[58],"codes,":[59,106,268],"e.g.":[60],"short":[61],"linear":[62],"block":[63],"At":[65],"same":[67,249],"time,":[68],"outperform":[76,197,225],"their":[77],"counterpart":[80,138],"for":[81,86,247,265,280],"shorter":[82],"lengths":[84],"space-time":[87],"applications":[89],"in":[90,96],"multiple-input":[91],"multiple-output":[92],"(MIMO)":[93],"systems.":[94],"Therefore,":[95],"contrast":[97],"previous":[99,259],"works":[100,260],"which":[101,261],"examined":[103],"this":[107,256],"paper":[108],"explores":[109],"combine":[114],"all":[115],"aforementioned":[118],"benefits":[119,176],"Additionally,":[127],"can":[131],"attain":[132],"higher":[133],"rates":[135],"than":[136],"We":[142],"first":[143],"propose":[144],"class":[146],"low":[151],"encoding":[152,158],"complexity,":[153],"where":[154],"number":[156],"operations":[159,208],"scales":[160],"linearly":[161],"length.":[165],"An":[166],"example":[167],"is":[168,194,213,241],"provided":[169],"illustrate":[171],"complexity":[175],"over":[180],"In":[188],"particular,":[189],"GF(4)":[191],"strong":[199,246],"GF(256)":[200],"while":[203],"requiring":[204],"approximately":[205],"9x":[206],"less":[207],"per":[209],"information":[210],"bit.":[211],"It":[212],"also":[214],"demonstrated":[215,263],"that":[216,243,264],"appropriate":[219],"parameters,":[220],"respect":[230],"both":[232],"floor":[235],"waterfall":[237],"performance.":[238],"Furthermore,":[239],"it":[240],"remains":[245],"rate":[251],"as":[252,272],"constellation":[254],"changes;":[255],"result":[257],"contrasts":[258],"optimal":[269],"parameters":[270],"such":[271],"column":[274],"weight":[275],"need":[276],"be":[278],"adjusted":[279],"different":[281],"constellations.":[282]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}