{"id":"https://openalex.org/W2626762393","doi":"https://doi.org/10.1109/lcomm.2017.2714684","title":"Useful Mathematical Tools for Capacity Approaching Codes Design","display_name":"Useful Mathematical Tools for Capacity Approaching Codes Design","publication_year":2017,"publication_date":"2017-06-12","ids":{"openalex":"https://openalex.org/W2626762393","doi":"https://doi.org/10.1109/lcomm.2017.2714684","mag":"2626762393"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2017.2714684","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2017.2714684","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arts.units.it/bitstream/11368/2914303/4/2914303_BSV_CL_17-PostPrint.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091426192","display_name":"F. Babich","orcid":"https://orcid.org/0000-0003-0121-5524"},"institutions":[{"id":"https://openalex.org/I142444530","display_name":"University of Trieste","ror":"https://ror.org/02n742c10","country_code":"IT","type":"education","lineage":["https://openalex.org/I142444530"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fulvio Babich","raw_affiliation_strings":["DIA, University of Trieste, Trieste, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIA, University of Trieste, Trieste, Italy","institution_ids":["https://openalex.org/I142444530"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025561875","display_name":"Alessandro Soranzo","orcid":"https://orcid.org/0000-0002-9766-3366"},"institutions":[{"id":"https://openalex.org/I142444530","display_name":"University of Trieste","ror":"https://ror.org/02n742c10","country_code":"IT","type":"education","lineage":["https://openalex.org/I142444530"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessandro Soranzo","raw_affiliation_strings":["DMG, University of Trieste, Trieste, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DMG, University of Trieste, Trieste, Italy","institution_ids":["https://openalex.org/I142444530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075301232","display_name":"F. Vatta","orcid":"https://orcid.org/0000-0003-4105-8084"},"institutions":[{"id":"https://openalex.org/I142444530","display_name":"University of Trieste","ror":"https://ror.org/02n742c10","country_code":"IT","type":"education","lineage":["https://openalex.org/I142444530"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesca Vatta","raw_affiliation_strings":["DIA, University of Trieste, Trieste, Italy"],"raw_orcid":"https://orcid.org/0000-0003-4105-8084","affiliations":[{"raw_affiliation_string":"DIA, University of Trieste, Trieste, Italy","institution_ids":["https://openalex.org/I142444530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I142444530"],"apc_list":null,"apc_paid":null,"fwci":3.7864,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.94114648,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"9","first_page":"1949","last_page":"1952"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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.9962000250816345,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9912999868392944,"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.7594699263572693},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.7225560545921326},{"id":"https://openalex.org/keywords/noisy-channel-coding-theorem","display_name":"Noisy-channel coding theorem","score":0.7193512916564941},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.6409466862678528},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5948655009269714},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5851662158966064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5466943979263306},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5318329930305481},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4510400593280792},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.43037110567092896},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.3918799161911011},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3877650499343872},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.37787064909935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35097557306289673},{"id":"https://openalex.org/keywords/white-noise","display_name":"White noise","score":0.21643951535224915},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1562187373638153},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14659690856933594},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12678083777427673},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.09834557771682739}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7594699263572693},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.7225560545921326},{"id":"https://openalex.org/C103073706","wikidata":"https://www.wikidata.org/wiki/Q2345282","display_name":"Noisy-channel coding theorem","level":5,"score":0.7193512916564941},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.6409466862678528},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5948655009269714},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5851662158966064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5466943979263306},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5318329930305481},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4510400593280792},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.43037110567092896},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3918799161911011},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3877650499343872},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.37787064909935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35097557306289673},{"id":"https://openalex.org/C112633086","wikidata":"https://www.wikidata.org/wiki/Q381287","display_name":"White noise","level":2,"score":0.21643951535224915},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1562187373638153},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14659690856933594},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12678083777427673},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.09834557771682739}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lcomm.2017.2714684","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2017.2714684","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"},{"id":"pmh:oai:arts.units.it:11368/2914303","is_oa":true,"landing_page_url":"http://hdl.handle.net/11368/2914303","pdf_url":"https://arts.units.it/bitstream/11368/2914303/4/2914303_BSV_CL_17-PostPrint.pdf","source":{"id":"https://openalex.org/S4306400480","display_name":"ArTS Archivio della ricerca di Trieste (University of Trieste https://www.units.it/)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142444530","host_organization_name":"University of Trieste","host_organization_lineage":["https://openalex.org/I142444530"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arts.units.it:11368/2914303","is_oa":true,"landing_page_url":"http://hdl.handle.net/11368/2914303","pdf_url":"https://arts.units.it/bitstream/11368/2914303/4/2914303_BSV_CL_17-PostPrint.pdf","source":{"id":"https://openalex.org/S4306400480","display_name":"ArTS Archivio della ricerca di Trieste (University of Trieste https://www.units.it/)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142444530","host_organization_name":"University of Trieste","host_organization_lineage":["https://openalex.org/I142444530"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6700000166893005,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2626762393.pdf","grobid_xml":"https://content.openalex.org/works/W2626762393.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1514578360","https://openalex.org/W1967815209","https://openalex.org/W2087040279","https://openalex.org/W2109489513","https://openalex.org/W2118420528","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W6677886596"],"related_works":["https://openalex.org/W2139745099","https://openalex.org/W2147429396","https://openalex.org/W2391555801","https://openalex.org/W2127950068","https://openalex.org/W2015101254","https://openalex.org/W2126543779","https://openalex.org/W2169710030","https://openalex.org/W2987657883","https://openalex.org/W1995419504","https://openalex.org/W2160552620"],"abstract_inverted_index":{"Focus":[0],"of":[1,8,94,149],"this":[2],"letter":[3],"is":[4],"the":[5,13,48,75,79,84,95,100,108,113,128,150],"oldest":[6],"class":[7],"codes":[9,55],"that":[10,27,118],"can":[11,28,124],"approach":[12],"Shannon":[14,85],"limit":[15],"quite":[16],"closely,":[17],"i.e.,":[18,82],"low-density":[19],"parity-check":[20],"(LDPC)":[21],"codes,":[22,107],"and":[23,52,91],"two":[24],"mathematical":[25],"tools":[26],"make":[29],"their":[30],"design":[31],"an":[32,119],"easier":[33],"job":[34],"under":[35,142],"appropriate":[36],"assumptions.":[37],"In":[38],"particular,":[39],"we":[40,87],"present":[41],"a":[42,89,136,145],"simple":[43,90],"algorithmic":[44],"method":[45],"to":[46,70,78,83,132],"estimate":[47],"threshold":[49],"for":[50,139],"regular":[51],"irregular":[53],"LDPC":[54],"on":[56],"memoryless":[57],"binary-input":[58],"continuous-output":[59],"additive":[60],"white":[61],"Gaussian":[62,137],"noise":[63,115],"(AWGN)":[64],"channels":[65],"with":[66],"sum-product":[67],"decoding,":[68],"and,":[69],"determine":[71],"how":[72],"close":[73],"are":[74,110],"obtained":[76],"thresholds":[77,109],"theoretical":[80],"maximum,":[81],"limit,":[86],"give":[88],"invertible":[92],"expression":[93],"AWGN":[96],"channel":[97],"capacity":[98],"in":[99],"binary":[101],"input-soft":[102],"output":[103],"case.":[104],"For":[105],"these":[106],"defined":[111],"as":[112,127],"maximum":[114],"level,":[116],"such":[117],"arbitrarily":[120],"small":[121],"bit-error":[122],"probability":[123],"be":[125],"achieved":[126],"block":[129],"length":[130],"tends":[131],"infinity.":[133],"We":[134],"assume":[135],"approximation":[138],"message":[140],"densities":[141],"density":[143],"evolution,":[144],"widely":[146],"used":[147],"simplification":[148],"decoding":[151],"algorithm.":[152]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}