{"id":"https://openalex.org/W2134248665","doi":"https://doi.org/10.1109/tc.2003.1228518","title":"Efficient encoding and decoding schemes for balanced codes","display_name":"Efficient encoding and decoding schemes for balanced codes","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W2134248665","doi":"https://doi.org/10.1109/tc.2003.1228518","mag":"2134248665"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2003.1228518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1228518","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-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/A5037152494","display_name":"Jong-Hoon Youn","orcid":"https://orcid.org/0000-0003-0360-3491"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jong-Hoon Youn","raw_affiliation_strings":["Department of Computer Science, University of Nebraska, Omaha, NE, USA","Dept. of Comput. Sci., Nebraska Univ., Omaha, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska, Omaha, NE, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Nebraska Univ., Omaha, NE, USA","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108201807","display_name":"B. Bose","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B. Bose","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","Oregon State University>"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"Oregon State University>","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037152494"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.6955,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.73412869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"52","issue":"9","first_page":"1229","last_page":"1232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994000196456909,"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.9991000294685364,"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/decoding-methods","display_name":"Decoding methods","score":0.7940744757652283},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.7535544633865356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7188968658447266},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5786604881286621},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49170857667922974},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4768284857273102},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.45283812284469604},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4441578984260559},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3690372705459595},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34561586380004883},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.30145102739334106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24676936864852905},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2300049066543579},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06782153248786926}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7940744757652283},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.7535544633865356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7188968658447266},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5786604881286621},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49170857667922974},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4768284857273102},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.45283812284469604},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4441578984260559},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3690372705459595},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34561586380004883},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.30145102739334106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24676936864852905},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2300049066543579},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06782153248786926}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2003.1228518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1228518","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1584147589","https://openalex.org/W1987232115","https://openalex.org/W1999082644","https://openalex.org/W2026712187","https://openalex.org/W2040555723","https://openalex.org/W2068651225","https://openalex.org/W2098128943","https://openalex.org/W2102346142","https://openalex.org/W2107192798","https://openalex.org/W2118789053","https://openalex.org/W2125636047","https://openalex.org/W2171784911","https://openalex.org/W2173850486","https://openalex.org/W6634832664"],"related_works":["https://openalex.org/W1599365967","https://openalex.org/W4205451769","https://openalex.org/W2052976169","https://openalex.org/W3102491039","https://openalex.org/W2028976748","https://openalex.org/W3017203753","https://openalex.org/W2983681086","https://openalex.org/W2029144766","https://openalex.org/W2109519980","https://openalex.org/W2103800122"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"introduce":[4],"two":[5],"encoding":[6],"and":[7],"decoding":[8],"methods":[9,15],"for":[10],"balanced":[11],"codes.":[12],"The":[13,24,47],"proposed":[14],"are":[16],"more":[17],"efficient":[18],"in":[19,44],"terms":[20],"of":[21,35,54],"computational":[22],"complexity.":[23],"first":[25],"one":[26,37,49],"complements":[27],"several":[28],"appropriate":[29],"bits":[30],"at":[31,39],"a":[32,40,51],"time":[33,41],"instead":[34],"complementing":[36],"bit":[38],"as":[42],"done":[43],"Knuth's":[45,55],"method.":[46,56],"second":[48],"is":[50],"parallel":[52],"implementation":[53]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}