{"id":"https://openalex.org/W4386072271","doi":"https://doi.org/10.1109/isit54713.2023.10206565","title":"Efficient Evaluation of the Probability of Error of Random Coding Ensembles","display_name":"Efficient Evaluation of the Probability of Error of Random Coding Ensembles","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386072271","doi":"https://doi.org/10.1109/isit54713.2023.10206565"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206565","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/f9b5fc69-6f16-4e15-aeb8-e12d6bfa2552","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075088681","display_name":"Ioannis Papoutsidakis","orcid":"https://orcid.org/0009-0008-5769-8629"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ioannis Papoutsidakis","raw_affiliation_strings":["University of Bristol,Communication Systems and Networks Group,Department of Electrical and Electronic Engineering,Bristol,UK,BS8 1UB"],"affiliations":[{"raw_affiliation_string":"University of Bristol,Communication Systems and Networks Group,Department of Electrical and Electronic Engineering,Bristol,UK,BS8 1UB","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090998891","display_name":"Angela Doufexi","orcid":"https://orcid.org/0000-0003-0133-6676"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Angela Doufexi","raw_affiliation_strings":["University of Bristol,Communication Systems and Networks Group,Department of Electrical and Electronic Engineering,Bristol,UK,BS8 1UB"],"affiliations":[{"raw_affiliation_string":"University of Bristol,Communication Systems and Networks Group,Department of Electrical and Electronic Engineering,Bristol,UK,BS8 1UB","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071769747","display_name":"Robert J. Piechocki","orcid":"https://orcid.org/0000-0002-4879-1206"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Robert J. Piechocki","raw_affiliation_strings":["University of Bristol,Communication Systems and Networks Group,Department of Electrical and Electronic Engineering,Bristol,UK,BS8 1UB"],"affiliations":[{"raw_affiliation_string":"University of Bristol,Communication Systems and Networks Group,Department of Electrical and Electronic Engineering,Bristol,UK,BS8 1UB","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075088681"],"corresponding_institution_ids":["https://openalex.org/I36234482"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08717742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2117","last_page":"2122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":1.0,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9994999766349792,"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/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.7507401704788208},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.707211971282959},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.697452962398529},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5919047594070435},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5877485275268555},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5707114934921265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.568871259689331},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.5618788003921509},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5178573131561279},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5161393880844116},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.44759753346443176},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4362450838088989},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4229409992694855},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3910681903362274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3397718071937561},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.2847049832344055},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.23168569803237915},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15407845377922058},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09935888648033142},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07926461100578308}],"concepts":[{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.7507401704788208},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.707211971282959},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.697452962398529},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5919047594070435},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5877485275268555},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5707114934921265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.568871259689331},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.5618788003921509},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5178573131561279},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5161393880844116},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.44759753346443176},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4362450838088989},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4229409992694855},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3910681903362274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3397718071937561},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.2847049832344055},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.23168569803237915},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15407845377922058},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09935888648033142},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07926461100578308},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit54713.2023.10206565","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/f9b5fc69-6f16-4e15-aeb8-e12d6bfa2552","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/f9b5fc69-6f16-4e15-aeb8-e12d6bfa2552","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"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":"Papoutsidakis, I, Doufexi, A & Piechocki, R J 2023, Efficient Evaluation of the Probability of Error of Random Coding Ensembles. in 2023 IEEE International Symposium on Information Theory. Proceedings (IEEE International Symposium on Information Theory. (ISIT), Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ISIT54713.2023.10206565","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire/f9b5fc69-6f16-4e15-aeb8-e12d6bfa2552","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/f9b5fc69-6f16-4e15-aeb8-e12d6bfa2552","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"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":"Papoutsidakis, I, Doufexi, A & Piechocki, R J 2023, Efficient Evaluation of the Probability of Error of Random Coding Ensembles. in 2023 IEEE International Symposium on Information Theory. Proceedings (IEEE International Symposium on Information Theory. (ISIT), Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ISIT54713.2023.10206565","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1984703306","https://openalex.org/W2017309302","https://openalex.org/W2029948740","https://openalex.org/W2044180609","https://openalex.org/W2106864314","https://openalex.org/W3134215910"],"related_works":["https://openalex.org/W2139769859","https://openalex.org/W2140357074","https://openalex.org/W2583282232","https://openalex.org/W2028268383","https://openalex.org/W2372190485","https://openalex.org/W3099663570","https://openalex.org/W2152220451","https://openalex.org/W3103136794","https://openalex.org/W4386072271","https://openalex.org/W4377009811"],"abstract_inverted_index":{"This":[0,43],"paper":[1],"presents":[2],"an":[3,14,58],"achievability":[4],"bound":[5,37,55,64],"that":[6,19,56],"evaluates":[7],"the":[8,29,51,68,72,77],"exact":[9],"probability":[10],"of":[11,13,16],"error":[12],"ensemble":[15],"random":[17,53],"codes":[18],"are":[20],"decoded":[21],"by":[22],"a":[23],"minimum":[24],"distance":[25],"decoder.":[26,61],"Compared":[27],"to":[28],"state-of-the-art":[30],"which":[31],"demands":[32],"exponential":[33],"computation":[34],"time,":[35],"this":[36],"is":[38,47,65],"evaluated":[39],"in":[40,45],"polynomial":[41],"time.":[42],"improvement":[44],"complexity":[46],"also":[48],"attainable":[49],"for":[50,67],"original":[52],"coding":[54],"utilizes":[57],"information":[59],"density":[60],"The":[62],"general":[63],"particularized":[66],"binary":[69,73],"symmetric":[70],"channel,":[71,75],"erasure":[74],"and":[76],"Gaussian":[78],"channel.":[79]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}