{"id":"https://openalex.org/W2620273385","doi":"https://doi.org/10.5075/epfl-thesis-7751","title":"Coding for Communications and Secrecy","display_name":"Coding for Communications and Secrecy","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2620273385","doi":"https://doi.org/10.5075/epfl-thesis-7751","mag":"2620273385"},"language":"en","primary_location":{"id":"pmh:oai:infoscience.tind.io:228453","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/137646","pdf_url":"https://infoscience.epfl.ch/record/228453/files/EPFL_TH7751.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/record/228453/files/EPFL_TH7751.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029531242","display_name":"Mani Bastaniparizi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bastaniparizi, Mani","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029531242"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.998199999332428,"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.998199999332428,"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/T11130","display_name":"Coding theory and cryptography","score":0.9911999702453613,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9876999855041504,"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/binary-erasure-channel","display_name":"Binary erasure channel","score":0.8116527795791626},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6584320664405823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6399309635162354},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6328206062316895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5838038921356201},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5706255435943604},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.568087100982666},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.497226744890213},{"id":"https://openalex.org/keywords/secrecy","display_name":"Secrecy","score":0.4927850067615509},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.47537246346473694},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.45573362708091736},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.44952550530433655},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.43173158168792725},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.419596403837204},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.3054247498512268},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29201510548591614},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.23345589637756348},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1712079644203186},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16865277290344238}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.8116527795791626},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6584320664405823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6399309635162354},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6328206062316895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5838038921356201},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5706255435943604},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.568087100982666},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.497226744890213},{"id":"https://openalex.org/C2776452267","wikidata":"https://www.wikidata.org/wiki/Q1503443","display_name":"Secrecy","level":2,"score":0.4927850067615509},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.47537246346473694},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.45573362708091736},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.44952550530433655},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.43173158168792725},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.419596403837204},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.3054247498512268},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29201510548591614},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.23345589637756348},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1712079644203186},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16865277290344238},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:infoscience.tind.io:228453","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/137646","pdf_url":"https://infoscience.epfl.ch/record/228453/files/EPFL_TH7751.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},{"id":"pmh:oai:infoscience.epfl.ch:228453","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/228453","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.5075/epfl-thesis-7751","is_oa":true,"landing_page_url":"https://doi.org/10.5075/epfl-thesis-7751","pdf_url":null,"source":{"id":"https://openalex.org/S4306400488","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"},{"id":"mag:2620273385","is_oa":false,"landing_page_url":"https://infoscience.epfl.ch/record/228453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:228453","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/137646","pdf_url":"https://infoscience.epfl.ch/record/228453/files/EPFL_TH7751.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doctoral thesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2620273385.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2991327005","https://openalex.org/W1605843482","https://openalex.org/W2099175407","https://openalex.org/W1963603265","https://openalex.org/W2128372030","https://openalex.org/W3178702488","https://openalex.org/W2987150391","https://openalex.org/W1974788990","https://openalex.org/W2119281313","https://openalex.org/W2787871348","https://openalex.org/W1993730784","https://openalex.org/W2129971925","https://openalex.org/W1990722740","https://openalex.org/W1486702987","https://openalex.org/W2096475427","https://openalex.org/W2188706516","https://openalex.org/W1966263746","https://openalex.org/W2011239304","https://openalex.org/W3176011636","https://openalex.org/W2169732368"],"abstract_inverted_index":{"Shannon,":[0],"in":[1,198,235,276,283,304,316,353,401,492,495,503],"his":[2],"landmark":[3],"1948":[4],"paper,":[5],"developed":[6],"a":[7,26,67,71,96,154,178,194,236,279,357,447,478],"framework":[8,268],"for":[9,115,166,180,281,363,392,451,522],"characterizing":[10],"the":[11,42,52,88,102,105,118,133,137,143,146,150,158,169,182,191,206,213,223,226,229,232,240,249,271,284,296,306,312,317,320,323,331,338,344,347,351,370,379,385,397,402,412,431,439,457,471,496,501,508,524],"fundamental":[12],"limits":[13],"of":[14,45,54,66,73,108,136,145,149,157,161,184,228,239,248,251,260,273,286,308,319,326,333,343,346,372,433,441,446,459,498],"information":[15,309,348],"transmission.":[16],"Among":[17],"other":[18],"results,":[19],"he":[20],"showed":[21],"that":[22,50,127,190,259,378,407,438,445,466,511,517],"reliable":[23,301],"communication":[24,167,302,435],"over":[25,87,168],"channel":[27,69,120,436],"is":[28,121,153,361,387,428,520],"possible":[29],"at":[30,101,293],"any":[31,55,452],"rate":[32,332,342,474],"below":[33,295],"its":[34],"capacity.":[35],"In":[36,104,201,322],"2008,":[37],"Arikan":[38],"discovered":[39],"polar":[40,61,113,162,186,253,262],"codes;":[41],"only":[43],"class":[44],"explicitly":[46],"constructed":[47,359],"low-complexity":[48,97],"codes":[49,80,114,163,254,263,367,395,410,513],"achieve":[51,488],"capacity":[53],"binary-input":[56],"memoryless":[57],"symmetric-output":[58],"channel.":[59,171],"Arikan's":[60],"transform":[62],"turns":[63],"independent":[64],"copies":[65],"noisy":[68],"into":[70],"collection":[72],"synthetic":[74,138],"almost-noiseless":[75,89],"and":[76,91,211,231,464],"almost-useless":[77],"channels.":[78],"Polar":[79],"are":[81],"realized":[82],"by":[83,94,209],"sending":[84],"data":[85],"bits":[86],"channels":[90,139,152],"recovering":[92],"them":[93],"using":[95],"successive-cancellation":[98],"(SC)":[99],"decoder,":[100],"receiver.":[103],"first":[106],"part":[107,325],"this":[109,203,327,334,462,493],"thesis,":[110,328],"we":[111,125,329,376,405,482,515],"study":[112,173,330,456],"communications.":[116,274,365],"When":[117],"underlying":[119],"an":[122,287,426],"erasure":[123,134,147,170],"channel,":[124],"show":[126,377,406,465],"almost":[128],"all":[129],"correlation":[130],"coefficients":[131],"between":[132,225],"events":[135],"decay":[140,341],"rapidly.":[141],"Hence,":[142],"sum":[144],"probabilities":[148],"information-carrying":[151],"tight":[155],"estimate":[156],"block-error":[159],"probability":[160],"when":[164,356],"used":[165,362],"We":[172,188,218,243,336,455],"SC":[174,256],"list":[175,241],"(SCL)":[176],"decoding,":[177],"method":[179,192],"boosting":[181],"performance":[183,233,250],"short":[185,261],"codes.":[187,419],"prove":[189],"has":[193],"numerically":[195],"stable":[196],"formulation":[197,204],"log-likelihood":[199],"ratios.":[200],"hardware,":[202],"increases":[205],"decoding":[207,257],"throughput":[208],"53%":[210],"reduces":[212],"decoder's":[214],"size":[215],"about":[216],"33%.":[217],"present":[219],"empirical":[220],"results":[221],"on":[222,461],"trade-off":[224],"length":[227],"CRC":[230],"gains":[234],"CRC-aided":[237],"version":[238],"decoder.":[242],"also":[244,269],"make":[245],"numerical":[246],"comparisons":[247],"long":[252],"under":[255,264],"with":[258],"SCL":[265],"decoding.":[266],"Shannon's":[267],"quantifies":[270],"secrecy":[272,297,414],"Wyner,":[275],"1975,":[277],"proposed":[278],"model":[280,355],"communications":[282],"presence":[285,497],"eavesdropper.":[288],"It":[289],"was":[290],"shown":[291],"that,":[292],"rates":[294],"capacity,":[298],"there":[299],"exist":[300],"schemes":[303,487],"which":[305],"amount":[307],"leaked":[310,349],"to":[311,350,384,422,429,476],"eavesdropper":[313,352,427],"decays":[314],"exponentially":[315],"block-length":[318],"code.":[321],"second":[324],"decay.":[335],"derive":[337],"exact":[339],"exponential":[340],"ensemble-average":[345],"Wyner's":[354],"randomly":[358],"code":[360],"secure":[364],"For":[366],"sampled":[368],"from":[369],"ensemble":[371],"i.i.d.":[373,417],"random":[374,393,408,418],"codes,":[375],"previously":[380],"known":[381],"lower":[382,398],"bound":[383,399],"exponent":[386,391,510],"exact.":[388],"Our":[389],"ensemble-optimal":[390],"constant-composition":[394],"improves":[396],"extant":[400],"literature.":[403],"Finally,":[404],"linear":[409],"have":[411],"same":[413],"power":[415],"as":[416],"The":[420],"key":[421],"securing":[423],"messages":[424],"against":[425],"exploit":[430],"randomness":[432],"her":[434,442],"so":[437],"statistics":[440],"observation":[443],"resembles":[444],"pure":[448],"noise":[449],"process":[450],"sent":[453],"message.":[454],"effect":[458],"feedback":[460,499],"approximation":[463,494],"it":[467],"does":[468],"not":[469],"reduce":[470],"minimum":[472],"entropy":[473],"required":[475],"approximate":[477],"given":[479],"process.":[480],"However,":[481],"give":[483],"examples":[484],"where":[485],"variable-length":[486,518],"much":[489],"larger":[490],"exponents":[491,502],"than":[500],"systems":[504],"without":[505],"feedback.":[506],"Upper-bounding":[507],"best":[509],"block":[512],"attain,":[514],"conclude":[516],"coding":[519],"necessary":[521],"achieving":[523],"improved":[525],"exponents.":[526]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}