{"id":"https://openalex.org/W2128593211","doi":"https://doi.org/10.1109/isit.2009.5205828","title":"Simple balanced codes that approach capacity","display_name":"Simple balanced codes that approach capacity","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2128593211","doi":"https://doi.org/10.1109/isit.2009.5205828","mag":"2128593211"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205828","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020855511","display_name":"Kees A. Schouhamer Immink","orcid":"https://orcid.org/0000-0001-6747-9261"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kees A. Schouhamer Immink","raw_affiliation_strings":["Turing Machines, Inc., Rotterdam, Netherlands","Turing Machines Inc., Willemskade 15b-d, 3016 DK Rotterdam The Netherlands"],"affiliations":[{"raw_affiliation_string":"Turing Machines, Inc., Rotterdam, Netherlands","institution_ids":[]},{"raw_affiliation_string":"Turing Machines Inc., Willemskade 15b-d, 3016 DK Rotterdam The Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058084781","display_name":"Jos H. Weber","orcid":"https://orcid.org/0000-0002-8333-1301"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jos H. Weber","raw_affiliation_strings":["TU Delft, IRCTR-CWPC, Delft, Netherlands","TU Delft, IRCTR/CWPC, Mekelweg 4, 2628 CD The Netherlands"],"affiliations":[{"raw_affiliation_string":"TU Delft, IRCTR-CWPC, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"TU Delft, IRCTR/CWPC, Mekelweg 4, 2628 CD The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020855511"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4362,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.73794401,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"1554","last_page":"1558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9987999796867371,"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/simple","display_name":"Simple (philosophy)","score":0.7173855900764465},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.7034569382667542},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6483361124992371},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5933294892311096},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.592045783996582},{"id":"https://openalex.org/keywords/simplicity","display_name":"Simplicity","score":0.5491046905517578},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47532346844673157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42465198040008545},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3826378583908081},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3623015582561493},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2709537744522095},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2267015278339386},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.13977742195129395}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7173855900764465},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.7034569382667542},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6483361124992371},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5933294892311096},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.592045783996582},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.5491046905517578},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47532346844673157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42465198040008545},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3826378583908081},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3623015582561493},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2709537744522095},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2267015278339386},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.13977742195129395},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205828","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.8199999928474426,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1579764623","https://openalex.org/W2026712187","https://openalex.org/W2035175249","https://openalex.org/W2068651225","https://openalex.org/W2086993486","https://openalex.org/W2125636047","https://openalex.org/W2152676955","https://openalex.org/W2153750480","https://openalex.org/W4254954060"],"related_works":["https://openalex.org/W2094225155","https://openalex.org/W1650274465","https://openalex.org/W2952674952","https://openalex.org/W2566439177","https://openalex.org/W2023299357","https://openalex.org/W4244214420","https://openalex.org/W2385872287","https://openalex.org/W2136927376","https://openalex.org/W2374499972","https://openalex.org/W2032216232"],"abstract_inverted_index":{"The":[0,88],"prior":[1],"art":[2],"construction":[3],"of":[4,6,18,24,35,85],"sets":[5],"balanced":[7,26],"codewords":[8],"by":[9,29,81],"Knuth":[10],"is":[11,48,56,69,80,98],"attractive":[12],"for":[13],"its":[14],"simplicity":[15],"and":[16,55,100],"absence":[17],"look-up":[19,53],"tables,":[20,54],"but":[21],"the":[22,25,63,66,72],"redundancy":[23],"codes":[27],"generated":[28],"Knuth's":[30,60,77],"algorithm":[31],"falls":[32],"a":[33,44,83,103],"factor":[34],"two":[36],"short":[37],"with":[38],"respect":[39],"to":[40],"capacity.":[41],"We":[42],"present":[43],"new":[45,64],"construction,":[46,65,78],"which":[47,92],"simple,":[49],"does":[50],"not":[51],"use":[52],"less":[57],"redundant":[58],"than":[59],"construction.":[61],"In":[62],"user":[67,86],"word":[68],"modified":[70],"in":[71,76,102],"same":[73],"way":[74],"as":[75],"that":[79,90],"inverting":[82],"segment":[84,93],"symbols.":[87],"prefix":[89],"indicates":[91],"has":[94],"been":[95],"inverted,":[96],"however,":[97],"encoded":[99],"decoded":[101],"different,":[104],"more":[105],"efficient,":[106],"way.":[107]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}