{"id":"https://openalex.org/W2084127117","doi":"https://doi.org/10.1109/tit.1978.1055876","title":"Minimax codes for finite alphabets (Corresp.)","display_name":"Minimax codes for finite alphabets (Corresp.)","publication_year":1978,"publication_date":"1978-05-01","ids":{"openalex":"https://openalex.org/W2084127117","doi":"https://doi.org/10.1109/tit.1978.1055876","mag":"2084127117"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1978.1055876","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1978.1055876","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"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 Information Theory","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/A5109212464","display_name":"J. Rissanen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. Rissanen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109212464"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7335,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.91862784,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"3","first_page":"389","last_page":"392"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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.9994999766349792,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9980999827384949,"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.9968000054359436,"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/combinatorics","display_name":"Combinatorics","score":0.6324586272239685},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5990534424781799},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5241656303405762},{"id":"https://openalex.org/keywords/sigma","display_name":"Sigma","score":0.49243196845054626},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4499630630016327},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4483444392681122},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43595054745674133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4172886610031128},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.362211674451828},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3592703938484192},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12743061780929565},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11896589398384094},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11261248588562012}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6324586272239685},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5990534424781799},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5241656303405762},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.49243196845054626},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4499630630016327},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4483444392681122},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43595054745674133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4172886610031128},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.362211674451828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3592703938484192},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12743061780929565},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11896589398384094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11261248588562012},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1978.1055876","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1978.1055876","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"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 Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W158805393","https://openalex.org/W2046419776","https://openalex.org/W2079145130","https://openalex.org/W2128777897","https://openalex.org/W2131024393"],"related_works":["https://openalex.org/W2016058626","https://openalex.org/W2474724840","https://openalex.org/W2895916002","https://openalex.org/W1814049089","https://openalex.org/W1977348009","https://openalex.org/W2369683208","https://openalex.org/W2084836983","https://openalex.org/W1530911128","https://openalex.org/W4213467041","https://openalex.org/W1965664006"],"abstract_inverted_index":{"Minimax":[0],"codes":[1],"are":[2,10],"designed":[3],"for":[4,14],"applications":[5],"where":[6],"the":[7,26,32,36],"symbol":[8],"probabilities":[9],"not":[11],"known":[12],"except":[13],"their":[15],"order.":[16],"A":[17],"minimax":[18],"code":[19],"is":[20],"defined":[21],"by":[22],"real-valued":[23],"parameters/,":[24],"(resembling":[25],"lengths":[27],"of":[28,38],"codewords)":[29],"which":[30],"minimize":[31],"maximum":[33],"ratio(\\Sigma_{i}p_{i}l_{i})/(--\\Sigma_{i}p_{i}\\logp_{i})subject":[34],"to\\Sigma_{i}2^{-l_{i}}\\leq1over":[35],"set":[37],"monotonically":[39],"nonincreasing":[40],"distributions":[41],"such":[42],"thatp_{1}\\leq1/mforman":[43],"integer":[44],"greater":[45],"than":[46],"one.":[47]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}