{"id":"https://openalex.org/W2913539890","doi":"https://doi.org/10.26190/unsworks/21298","title":"Optimal erasure protection assignment for scalably compressed data over packet-based networks","display_name":"Optimal erasure protection assignment for scalably compressed data over packet-based networks","publication_year":2022,"publication_date":"2022-03-23","ids":{"openalex":"https://openalex.org/W2913539890","doi":"https://doi.org/10.26190/unsworks/21298","mag":"2913539890"},"language":"en","primary_location":{"id":"pmh:oai:unsworks.unsw.edu.au:1959.4/19373","is_oa":false,"landing_page_url":"http://handle.unsw.edu.au/1959.4/19373","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.26190/unsworks/21298","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086363425","display_name":"Johnson Thie","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Thie, Johnson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5086363425"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9868000149726868,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9868000149726868,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9847999811172485,"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/T11478","display_name":"Caching and Content Delivery","score":0.9779000282287598,"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/network-packet","display_name":"Network packet","score":0.7474420666694641},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7219616770744324},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5578405857086182},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5555708408355713},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.536568284034729},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.5148171782493591},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.46890509128570557},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4578584134578705},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4409029483795166},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4286801815032959},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3908722400665283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38699668645858765},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34707772731781006},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3390001058578491},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2852148711681366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14247438311576843}],"concepts":[{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7474420666694641},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7219616770744324},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5578405857086182},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5555708408355713},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.536568284034729},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.5148171782493591},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.46890509128570557},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4578584134578705},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4409029483795166},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4286801815032959},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3908722400665283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38699668645858765},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34707772731781006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3390001058578491},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2852148711681366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14247438311576843},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:unsworks.unsw.edu.au:1959.4/19373","is_oa":false,"landing_page_url":"http://handle.unsw.edu.au/1959.4/19373","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/19373","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.4/19373","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"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":"http://purl.org/coar/resource_type/c_db06"},{"id":"doi:10.26190/unsworks/21298","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/21298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Dissertation"},{"id":"mag:2913539890","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1048253","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":"doi:10.26190/unsworks/21298","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/21298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1585369105","https://openalex.org/W2181702265","https://openalex.org/W2187622115","https://openalex.org/W142699050","https://openalex.org/W1522412108","https://openalex.org/W2950394205","https://openalex.org/W2093800494","https://openalex.org/W3099652385","https://openalex.org/W2186720838","https://openalex.org/W2953001314","https://openalex.org/W1549633577","https://openalex.org/W3103022991","https://openalex.org/W1607286178","https://openalex.org/W2526962722","https://openalex.org/W2321986626","https://openalex.org/W2950140548","https://openalex.org/W184307570","https://openalex.org/W2582667927","https://openalex.org/W2188218689","https://openalex.org/W1867834322"],"abstract_inverted_index":{"This":[0],"research":[1],"is":[2,91,243,257,264],"concerned":[3],"with":[4,68,74],"the":[5,39,101,122,130,144,149,156,204,212,225,228,234,286,317,330,338],"reliable":[6],"delivery":[7],"of":[8,28,36,51,88,100,106,174,182,227,240,251,275,309,321,332,340],"scalable":[9,29,102,252],"compressed":[10],"data":[11,56,103,253,277],"over":[12],"lossy":[13],"communication":[14],"channels.":[15],"Recent":[16],"works":[17],"proposed":[18,145,205,229],"several":[19],"strategies":[20,230],"for":[21,96,231,248,323],"assigning":[22,98],"optimal":[23,126,208],"code":[24,115,127,151,209],"redundancies":[25,128,210],"to":[26,92,104,109,129,134,155,170,180,185,190,211,216,244,282,293],"elements":[27,44,99,177],"data,":[30],"which":[31],"form":[32],"a":[33,48,94,118,135,200,217,246],"linear":[34],"structure":[35],"dependency,":[37],"under":[38],"assumption":[40],"that":[41,143,262],"all":[42],"source":[43,131,213,300,325],"are":[45,79,178],"encoded":[46],"onto":[47],"common":[49],"group":[50],"network":[52,59],"packets.":[53,84],"Given":[54,117,199],"large":[55],"and":[57,114,195,319],"small":[58,77],"packets,":[60,107],"such":[61],"schemes":[62,153,169,206],"require":[63],"very":[64],"long":[65,83],"channel":[66,162,196],"codes":[67],"high":[69,75,161],"computational":[70],"complexity.":[71,116],"In":[72,285],"networks":[73],"loss,":[76],"packets":[78,183],"more":[80],"desirable":[81],"than":[82],"The":[85,237],"first":[86],"contribution":[87,239],"this":[89,241],"thesis":[90,242],"propose":[93,245],"strategy":[95,146],"optimally":[97],"clusters":[105,181],"subject":[108,133,154,189,215],"constraints":[110,191],"on":[111,137,192,219],"packet":[112,119,193,201],"size":[113,194],"cluster":[120,202],"arrangement,":[121,203],"scheme":[123,247],"then":[124],"assigns":[125],"elements,":[132,214],"constraint":[136,218],"transmission":[138,220,318],"length.":[139,198,221],"Experimental":[140,222,335],"results":[141,223,336],"show":[142],"can":[147,302],"outperform":[148],"previous":[150],"assignment":[152],"above-mentioned":[157],"constraints,":[158],"particularly":[159],"at":[160],"loss":[163],"rates.":[164],"Secondly,":[165],"we":[166,289],"modify":[167],"these":[168],"accommodate":[171],"complex":[172],"structures":[173],"dependency.":[175],"Source":[176],"allocated":[179],"according":[184],"their":[186],"dependency":[187,235],"structure,":[188],"codeword":[197],"assign":[207],"demonstrate":[224],"superiority":[226],"correctly":[232],"modelling":[233],"structure.":[236],"last":[238],"optimizing":[249],"protection":[250,322],"where":[254,298],"limited":[255,341],"retransmission":[256,263,274],"possible.":[258,266],"Previous":[259],"work":[260,288],"assumed":[261],"not":[265],"For":[267],"most":[268],"real-time":[269],"or":[270,307],"interactive":[271],"applications,":[272],"however,":[273],"lost":[276],"may":[278],"be":[279,303],"possible":[280],"up":[281],"some":[283],"limit.":[284],"present":[287],"restrict":[290],"our":[291],"attention":[292],"streaming":[294],"sources":[295],"(e.g.,":[296],"video)":[297],"each":[299,324],"element":[301],"transmitted":[304],"in":[305],"one":[306],"both":[308],"two":[310],"time":[311],"slots.":[312],"An":[313],"optimization":[314],"algorithm":[315],"determines":[316],"level":[320],"element,":[326],"using":[327],"information":[328],"about":[329],"success":[331],"earlier":[333],"transmissions.":[334],"confirm":[337],"benefit":[339],"retransmission.":[342]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}