{"id":"https://openalex.org/W1870326161","doi":"https://doi.org/10.5075/epfl-thesis-4488","title":"Source and channel coding using Fountain codes","display_name":"Source and channel coding using Fountain codes","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1870326161","doi":"https://doi.org/10.5075/epfl-thesis-4488","mag":"1870326161"},"language":"en","primary_location":{"id":"pmh:oai:infoscience.tind.io:140337","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/41854","pdf_url":"http://infoscience.epfl.ch/record/140337","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":"http://infoscience.epfl.ch/record/140337","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020885766","display_name":"Bertrand Ndzana Ndzana","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ndzana Ndzana, Bertrand","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020885766"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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.9976999759674072,"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.9976999759674072,"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/T12029","display_name":"DNA and Biological Computing","score":0.9948999881744385,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9763000011444092,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6767974495887756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6617230772972107},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5668431520462036},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5552604794502258},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.5127328634262085},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48674488067626953},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.45877134799957275},{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.44803640246391296},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3947663903236389},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3708074986934662},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3631118834018707}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6767974495887756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6617230772972107},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5668431520462036},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5552604794502258},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.5127328634262085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48674488067626953},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.45877134799957275},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.44803640246391296},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3947663903236389},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3708074986934662},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3631118834018707}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:infoscience.tind.io:140337","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/41854","pdf_url":"http://infoscience.epfl.ch/record/140337","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:140337","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/140337","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-4488","is_oa":true,"landing_page_url":"https://doi.org/10.5075/epfl-thesis-4488","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:1870326161","is_oa":false,"landing_page_url":"https://infoscience.epfl.ch/record/140337","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:140337","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/41854","pdf_url":"http://infoscience.epfl.ch/record/140337","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/W1870326161.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2952530706","https://openalex.org/W2740333227","https://openalex.org/W2509230770","https://openalex.org/W2952018999","https://openalex.org/W2952158066","https://openalex.org/W2999217642","https://openalex.org/W2949972418","https://openalex.org/W2911439725","https://openalex.org/W2964159840","https://openalex.org/W2793267668","https://openalex.org/W2142472541","https://openalex.org/W2964288260","https://openalex.org/W2022069541","https://openalex.org/W182933219","https://openalex.org/W2976508674","https://openalex.org/W2963873929","https://openalex.org/W2963307211","https://openalex.org/W2232446554","https://openalex.org/W2612841544","https://openalex.org/W2901572798"],"abstract_inverted_index":{"The":[0,16],"invention":[1],"of":[2,12,18,35,46,89,107,133,142,153,231],"Fountain":[3,36],"codes":[4,37,99,118,155,210],"is":[5,21,162],"a":[6,33,60,94,105,204,245],"major":[7],"advance":[8],"in":[9,67,131,251],"the":[10,48,86,128,151,160,193,228,258,271],"field":[11],"error":[13,136],"correcting":[14],"codes.":[15,41,240],"goal":[17],"this":[19,90,114,232,252],"work":[20],"to":[22,82,116,191,198,257],"study":[23],"and":[24,29,79,109,122,135,170,184,195,276],"develop":[25,93,179,203,235],"algorithms":[26,74,180,223,237,268],"for":[27,55,97,140,145,181,208,224],"source":[28,266],"channel":[30],"coding":[31,267],"using":[32,238],"family":[34],"known":[38,51,81],"as":[39],"Raptor":[40,117,154,209,239],"From":[42],"an":[43],"asymptotic":[44],"point":[45],"view,":[47],"best":[49,129],"currently":[50],"sum-product":[52,72,108,157,196],"decoding":[53,73,95,158],"algorithm":[54,96,115,126,197,207],"non":[56],"binary":[57,70,98],"alphabets":[58],"has":[59],"high":[61],"complexity":[62,134],"that":[63],"limits":[64],"its":[65],"use":[66],"practice.":[68],"For":[69],"channels,":[71],"have":[75],"been":[76],"extensively":[77],"studied":[78],"are":[80],"perform":[83],"well.":[84],"In":[85,227],"first":[87],"part":[88,230],"work,":[91,233],"we":[92,149,217,234,243,263],"on":[100,104,119,165,171,211,270],"non-binary":[101],"channels":[102,169,172],"based":[103,269],"combination":[106],"maximum-likelihood":[110],"decoding.":[111],"We":[112,178,201],"apply":[113],"both":[120],"symmetric":[121,146],"non-symmetric":[123],"channels.":[124,147,215,226],"Our":[125],"shows":[127],"performance":[130,152],"terms":[132],"rate":[137],"per":[138],"symbol":[139],"blocks":[141],"finite":[143],"length":[144],"Then,":[148],"examine":[150],"under":[156],"when":[159],"transmission":[161],"taking":[163],"place":[164],"piecewise":[166,212],"stationary":[167,213],"memoryless":[168,214],"with":[173],"memory":[174],"corrupted":[175],"by":[176,274],"noise.":[177],"joint":[182,220],"estimation":[183],"detection":[185],"while":[186],"simultaneously":[187],"employing":[188],"expectation":[189],"maximization":[190],"estimate":[192],"noise,":[194],"correct":[199],"errors.":[200],"also":[202],"hard":[205],"decision":[206],"Finally,":[216],"generalize":[218],"our":[219],"LT":[221],"estimation-decoding":[222],"Markov-modulated":[225],"third":[229],"compression":[236,248],"More":[241],"specifically":[242],"introduce":[244],"lossless":[246],"text":[247],"algorithm,":[249],"obtaining":[250],"way":[253],"competitive":[254],"results":[255],"compared":[256],"existing":[259],"classical":[260],"approaches.":[261],"Moreover,":[262],"propose":[264],"distributed":[265],"paradigm":[272],"proposed":[273],"Slepian":[275],"Wolf.":[277]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}