{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004439371,0.0004882961,0.0005505282,0.0007376253,0.0005107723,0.0007392224,0.0006251152,0.0004507092,0.001604577],"category_scores_gemma":[0.002308565,0.0002897981,0.0003831341,0.0008797072,0.0006368097,0.001600938,0.001281288,0.0007355866,0.0006224194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005435181,"about_ca_system_score_gemma":0.0009006719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005100505,"about_ca_topic_score_gemma":0.0007078201,"domain_scores_codex":[0.9993842,0.0001304391,0.00004337788,0.00007418409,0.0002732335,0.00009460669],"domain_scores_gemma":[0.9991911,0.0003261046,0.0001246382,0.0001888352,0.0001192279,0.0000501518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006169397,0.0001056711,0.0008063511,0.0002498961,0.0000464541,0.0004558378,0.0002839005,0.07925657,0.08634894,0.6436844,0.003677436,0.1844676],"study_design_scores_gemma":[0.0002062081,0.0005069599,0.0005094259,0.0001462493,0.00005314628,0.0008540415,0.0001080302,0.4355673,0.1119984,0.4273346,0.02261505,0.0001006594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1303093,0.0004935418,0.8576096,0.0003326456,0.0001042805,0.00008702288,0.0002390745,0.0004846332,0.01033997],"genre_scores_gemma":[0.5855179,0.0006436186,0.405894,0.0002240501,0.00006762923,0.0001969799,0.0006026349,0.0001557954,0.006697354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001604577,"threshold_uncertainty_score":0.005367875,"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."}}