{"id":"https://openalex.org/W1992999547","doi":"https://doi.org/10.1109/isit.2007.4557538","title":"On the Mapping of Low-Density Parity-Check Codes for Bit-Interleaved Coded Modulation","display_name":"On the Mapping of Low-Density Parity-Check Codes for Bit-Interleaved Coded Modulation","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W1992999547","doi":"https://doi.org/10.1109/isit.2007.4557538","mag":"1992999547"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 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/A5060531157","display_name":"G. Richter","orcid":null},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gerd Richter","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany","Inst. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Ulm"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Inst. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Ulm","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016740571","display_name":"A. Hof","orcid":null},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Axel Hof","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany","Inst. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Ulm"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Inst. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Ulm","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045353828","display_name":"Martin Bossert","orcid":"https://orcid.org/0000-0002-3827-9065"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Bossert","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany","Inst. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Ulm"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]},{"raw_affiliation_string":"Inst. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Ulm","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":0.6737,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.73370422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"e86 a","issue":null,"first_page":"2146","last_page":"2150"},"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.9987999796867371,"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 and Biological Computing","score":0.9901999831199646,"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.9250093698501587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6473526954650879},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5770871639251709},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5298544764518738},{"id":"https://openalex.org/keywords/parity-bit","display_name":"Parity bit","score":0.474334180355072},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44505205750465393},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.4429934620857239},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4424024224281311},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.4381343126296997},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"Bit error rate","score":0.43334323167800903},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.42015600204467773},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.4139888286590576},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4105090796947479},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3954964280128479},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.34113824367523193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33024758100509644},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.24385830760002136}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9250093698501587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6473526954650879},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5770871639251709},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5298544764518738},{"id":"https://openalex.org/C131521367","wikidata":"https://www.wikidata.org/wiki/Q625502","display_name":"Parity bit","level":2,"score":0.474334180355072},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44505205750465393},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.4429934620857239},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4424024224281311},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.4381343126296997},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.43334323167800903},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.42015600204467773},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.4139888286590576},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4105090796947479},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3954964280128479},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.34113824367523193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33024758100509644},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.24385830760002136},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2007.4557538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W91277888","https://openalex.org/W1511760703","https://openalex.org/W1571355906","https://openalex.org/W1964402820","https://openalex.org/W1992360673","https://openalex.org/W2098470405","https://openalex.org/W2115104320","https://openalex.org/W2122989348","https://openalex.org/W2126259959","https://openalex.org/W2127490352","https://openalex.org/W2133068391","https://openalex.org/W2139167772","https://openalex.org/W2141081933","https://openalex.org/W2146585832","https://openalex.org/W2156938362","https://openalex.org/W2167394661","https://openalex.org/W4236184348","https://openalex.org/W4256648168","https://openalex.org/W4300188436","https://openalex.org/W6603727012","https://openalex.org/W6630670498","https://openalex.org/W6634277534"],"related_works":["https://openalex.org/W2139745099","https://openalex.org/W2015101254","https://openalex.org/W2132566027","https://openalex.org/W1782566311","https://openalex.org/W1968988046","https://openalex.org/W2127950068","https://openalex.org/W2373473769","https://openalex.org/W2126450554","https://openalex.org/W2102251435","https://openalex.org/W2114468163"],"abstract_inverted_index":{"Low-density":[0],"parity-check":[1],"(LDPC)":[2],"codes":[3,9,41,127],"are":[4,70],"very":[5],"powerful":[6],"error":[7,26,131],"correction":[8],"for":[10,65],"bit-interleaved":[11],"coded":[12],"modulation":[13],"(BICM)":[14],"schemes.":[15],"In":[16,28],"BICM":[17],"schemes":[18],"the":[19,36,44,55,60,75,88,91,95,112,129],"bits":[20],"of":[21,38,47,77,90,125,138],"one":[22],"symbol":[23],"have":[24],"unequal":[25],"protection.":[27],"this":[29],"paper,":[30],"we":[31,73,86],"show":[32,115],"how":[33],"to":[34,54,81,94,110,134],"improve":[35],"performance":[37],"given":[39],"LDPC":[40,92,126,139],"by":[42,99,116,119],"mapping":[43,89,124,137],"variable":[45],"nodes":[46],"certain":[48],"degree":[49],"in":[50],"a":[51,100,105,122,135],"special":[52,123],"way":[53],"different":[56,96],"bit":[57,68,97,130],"levels.":[58],"Since":[59],"equivalent":[61],"binary-input":[62],"component":[63],"channels":[64],"each":[66],"individual":[67],"level":[69],"not":[71],"symmetric,":[72],"use":[74],"tool":[76],"i.i.d.":[78],"channel":[79],"adapters":[80],"force":[82],"symmetry.":[83],"After":[84],"that,":[85],"optimize":[87],"code":[93],"levels":[98],"downhill":[101],"algorithm":[102],"that":[103,121],"uses":[104],"generalized":[106],"discretized":[107],"density":[108],"evolution":[109],"calculate":[111],"thresholds.":[113],"We":[114],"thresholds":[117],"and":[118],"simulations":[120],"lowers":[128],"rates":[132],"compared":[133],"random":[136],"codes.":[140]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}