{"id":"https://openalex.org/W2920812688","doi":"https://doi.org/10.23919/isita.2018.8664368","title":"Arbitrarily Low Redundancy Construction of Balanced Codes Using Realistic Resources","display_name":"Arbitrarily Low Redundancy Construction of Balanced Codes Using Realistic Resources","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2920812688","doi":"https://doi.org/10.23919/isita.2018.8664368","mag":"2920812688"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664368","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002805475","display_name":"Danny Dub\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I43406934","display_name":"Universit\u00e9 Laval","ror":"https://ror.org/04sjchr03","country_code":"CA","type":"education","lineage":["https://openalex.org/I43406934"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Danny Dube","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Universit\u00e9 Laval, Quebec City, Quebec, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Universit\u00e9 Laval, Quebec City, Quebec, Canada","institution_ids":["https://openalex.org/I43406934"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002805475"],"corresponding_institution_ids":["https://openalex.org/I43406934"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18891118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"595","last_page":"599"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.984499990940094,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9821000099182129,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/redundancy","display_name":"Redundancy (engineering)","score":0.9122387766838074},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7074415683746338},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6627201437950134},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.5426746606826782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5156211256980896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4700086712837219},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4583742618560791},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4105035662651062}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.9122387766838074},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7074415683746338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6627201437950134},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.5426746606826782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5156211256980896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4700086712837219},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4583742618560791},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4105035662651062},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/isita.2018.8664368","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1584147589","https://openalex.org/W2034323860","https://openalex.org/W2098970008","https://openalex.org/W2125636047","https://openalex.org/W2141655375","https://openalex.org/W2150228548","https://openalex.org/W2161620965","https://openalex.org/W2740058122","https://openalex.org/W6634832664"],"related_works":["https://openalex.org/W2468279273","https://openalex.org/W2354198838","https://openalex.org/W1989130879","https://openalex.org/W2103419012","https://openalex.org/W2988126442","https://openalex.org/W1974414866","https://openalex.org/W2063982682","https://openalex.org/W2338543196","https://openalex.org/W1544691147","https://openalex.org/W1963637513"],"abstract_inverted_index":{"Recently,":[0],"Dub\u00e9":[1],"and":[2,27,77,81,140],"Mechqrane":[3],"presented":[4],"a":[5,88,117,132],"construction":[6,16,37],"technique":[7,57,94,108,126],"to":[8,70,97],"encode":[9],"plain":[10],"data":[11],"into":[12],"balanced":[13],"codewords.":[14],"The":[15,30,41],"is":[17,33,38,61,90],"based":[18],"on":[19],"permutations,":[20],"the":[21,52,79,99,103,107,110,113,125,136,143],"well":[22],"known":[23],"arcade":[24],"game":[25],"Pacman,":[26],"limited-precision":[28],"integers.":[29],"redundancy":[31,134],"that":[32,128],"introduced":[34],"by":[35,55],"their":[36,56,93],"particularly":[39],"low.":[40],"results":[42],"are":[43],"noticeably":[44],"better":[45,133],"than":[46,135],"those":[47],"of":[48,106,112],"previous":[49],"work.":[50],"Still,":[51],"resources":[53],"required":[54],"remain":[58],"modest:":[59],"there":[60],"no":[62,68],"need":[63,69],"for":[64,84],"large":[65,75],"lookup":[66],"tables,":[67],"perform":[71],"costly":[72],"calculations":[73],"using":[74],"integers,":[76],"yet":[78],"time":[80],"space":[82],"complexity":[83],"encoding":[85],"or":[86],"decoding":[87],"block":[89],"linear.":[91],"Although":[92],"allows":[95],"one":[96,139],"achieve":[98,131],"best":[100,137],"per-block":[101,104,138],"redundancy,":[102,115],"aspect":[105],"prevents":[109],"achievement":[111],"optimal":[114,144],"in":[116],"global":[118,145],"sense.":[119],"In":[120],"this":[121],"paper,":[122],"we":[123,129],"extend":[124],"so":[127],"can":[130],"arbitrarily":[141],"approach":[142],"redundancy.":[146]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}