{"id":"W2740058122","doi":"10.1109/cwit.2017.7994820","title":"Almost minimum-redundancy construction of balanced codes using limited-precision integers","year":2017,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Redundancy (engineering); Decoding methods; Encoding (memory); ENCODE; Computer science; Algorithm; Theoretical computer science; Computational complexity theory; Block code; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001777847,0.0001148607,0.0001937219,0.00007633049,0.0003636756,0.0002385392,0.001090717,0.00006756568,0.00003276416],"category_scores_gemma":[0.000116299,0.00009117145,0.00005467787,0.00008467091,0.0001574512,0.001181391,0.0006184647,0.00008423379,0.00001000214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000224459,"about_ca_system_score_gemma":0.00005375146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001969545,"about_ca_topic_score_gemma":0.000006087532,"domain_scores_codex":[0.9989786,0.00003060613,0.0002653742,0.0003140602,0.0002420258,0.0001693891],"domain_scores_gemma":[0.9982786,0.00006993364,0.0003091041,0.001138366,0.0001341929,0.00006985757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000658614,0.0001534324,0.01058892,0.00004449742,0.00004645351,0.00001818415,0.000480684,0.0002369679,0.1095315,0.043914,0.002387584,0.8325319],"study_design_scores_gemma":[0.0008042576,0.000123225,0.01093816,0.0003196436,0.00001191426,0.00006495114,0.0001549857,0.906323,0.0736692,0.005486272,0.001781598,0.0003228383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2045451,0.00004947568,0.790995,0.0001471486,0.0009032552,0.00008746448,0.000009662998,0.00006053966,0.00320242],"genre_scores_gemma":[0.6193106,0.00002556988,0.3805165,0.00002562683,0.00004511247,0.000001067963,0.000003732461,0.000004460003,0.00006732294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.906086,"threshold_uncertainty_score":0.3717864,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03436210792530513,"score_gpt":0.301457592321295,"score_spread":0.2670954843959899,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}