{"id":"https://openalex.org/W2147225015","doi":"https://doi.org/10.1109/isit.2009.5205931","title":"Capacity achieving codes From randomness conductors","display_name":"Capacity achieving codes From randomness conductors","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2147225015","doi":"https://doi.org/10.1109/isit.2009.5205931","mag":"2147225015"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/43012","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002790246","display_name":"Mahdi Cheraghchi","orcid":"https://orcid.org/0000-0001-8957-0306"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Mahdi Cheraghchi","raw_affiliation_strings":["School of Computer and Communication Sciences, Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland","School of Computer and Communication Sciences EPFL, Lausanne, Switzerland#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"School of Computer and Communication Sciences EPFL, Lausanne, Switzerland#TAB#","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002790246"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.67431999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2639","last_page":"2643"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9990000128746033,"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/randomness","display_name":"Randomness","score":0.7873041033744812},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6647868752479553},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6060158014297485},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.49738720059394836},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.4838758707046509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46060875058174133},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4582192003726959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4566257894039154},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.456320583820343},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4523299038410187},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4418315291404724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43022146821022034},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3855050206184387},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19562044739723206},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.09144416451454163},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08486375212669373}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7873041033744812},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6647868752479553},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6060158014297485},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.49738720059394836},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.4838758707046509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46060875058174133},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4582192003726959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4566257894039154},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.456320583820343},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4523299038410187},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4418315291404724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43022146821022034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3855050206184387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19562044739723206},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.09144416451454163},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08486375212669373},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2009.5205931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.243.4828","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.243.4828","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0901.1866v1.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.tind.io:141320","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/43012","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},{"id":"pmh:oai:spiral.imperial.ac.uk:10044/1/63178","is_oa":false,"landing_page_url":"http://hdl.handle.net/10044/1/63178","pdf_url":null,"source":{"id":"https://openalex.org/S4306401396","display_name":"Spiral (Imperial College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I47508984","host_organization_name":"Imperial College London","host_organization_lineage":["https://openalex.org/I47508984"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE International Symposium on Information Theory (ISIT 2009)","raw_type":"Conference Paper"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:141320","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/43012","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1593683169","https://openalex.org/W1967175855","https://openalex.org/W1995875735","https://openalex.org/W2014860393","https://openalex.org/W2064423787","https://openalex.org/W2119913278","https://openalex.org/W2135393523","https://openalex.org/W2143299189","https://openalex.org/W2148180254","https://openalex.org/W2293000460","https://openalex.org/W2809548040","https://openalex.org/W2895239415","https://openalex.org/W2914980053","https://openalex.org/W2993383518","https://openalex.org/W3138266838","https://openalex.org/W4229826396","https://openalex.org/W4229922087"],"related_works":["https://openalex.org/W2373577936","https://openalex.org/W2368824897","https://openalex.org/W1508050556","https://openalex.org/W1910862367","https://openalex.org/W2379365082","https://openalex.org/W2370747590","https://openalex.org/W2030109976","https://openalex.org/W2369260257","https://openalex.org/W2389120450","https://openalex.org/W55249799"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,16],"general":[3],"framework":[4],"for":[5,15,125,150,157],"construction":[6,112],"of":[7,10,19,45,76,91],"small":[8,102,144],"ensembles":[9,67,97],"capacity":[11,70,122,155],"achieving":[12,71,123,156],"linear":[13,131,136],"codes":[14,124],"wide":[17],"range":[18],"(not":[20],"necessarily":[21],"memoryless)":[22],"discrete":[23],"symmetric":[24,33],"channels,":[25],"and":[26,32,48,134,142,154],"in":[27,39,57,105],"particular,":[28],"the":[29,43,65,106],"binary":[30],"erasure":[31],"channels.":[34],"The":[35,147],"main":[36],"tool":[37],"used":[38],"our":[40,111],"constructions":[41,90],"is":[42,100,152],"notion":[44],"randomness":[46,92],"extractors":[47],"lossless":[49],"condensers":[50],"that":[51],"are":[52],"regarded":[53],"as":[54,62,101,103],"central":[55],"tools":[56],"theoretical":[58],"computer":[59],"science.":[60],"Same":[61],"random":[63],"codes,":[64],"resulting":[66],"preserve":[68],"their":[69],"properties":[72],"under":[73],"any":[74],"change":[75],"basis.":[77],"Our":[78],"methods":[79],"can":[80],"potentially":[81],"lead":[82],"to":[83,113],"polynomial-sized":[84],"ensembles;":[85],"however,":[86],"using":[87],"known":[88],"explicit":[89,121,148],"conductors":[93],"we":[94,119],"obtain":[95,120],"specific":[96],"whose":[98],"size":[99],"quasipolynomial":[104],"block":[107,159],"length.":[108,160],"By":[109],"applying":[110],"Justesen's":[114],"concatenation":[115],"scheme":[116],"(Justesen,":[117],"1972)":[118],"BEC":[126,151],"(resp.,":[127,138],"BSC)":[128],"with":[129],"almost":[130,135],"time":[132,137],"encoding":[133],"quadratic":[139],"time)":[140],"decoding":[141],"exponentially":[143],"error":[145],"probability.":[146],"code":[149],"defined":[153],"every":[158]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}