{"id":"W2976570834","doi":"10.1109/isit.2019.8849758","title":"Decision Procedure for the Existence of Two-Channel Prefix-Free Codes","year":2019,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Prefix; Prefix code; Rectangle; Code (set theory); Computer science; Decision problem; Algorithm; Channel (broadcasting); Linear inequality; Mathematics; Mathematical optimization; Theoretical computer science; Inequality; Linear code; Block code; Telecommunications; Programming language; Decoding methods","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.003285485,0.0007585699,0.001085487,0.00107582,0.001016693,0.001844228,0.001461075,0.001427783,0.006317653],"category_scores_gemma":[0.01490588,0.0005779727,0.0007578633,0.001338309,0.001949062,0.003413632,0.003189817,0.00296264,0.001051177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008807309,"about_ca_system_score_gemma":0.001945155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005911886,"about_ca_topic_score_gemma":0.0006554952,"domain_scores_codex":[0.9963183,0.001219557,0.0003295917,0.0007696722,0.0008551228,0.0005076824],"domain_scores_gemma":[0.9860994,0.01089563,0.0007111366,0.000953791,0.001062095,0.0002779727],"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.00163033,0.0003261349,0.001003721,0.0005438934,0.0001349924,0.0005236201,0.0005137885,0.1731803,0.03252076,0.5091494,0.00718635,0.2732866],"study_design_scores_gemma":[0.0002770153,0.0003064015,0.0003347669,0.00007886628,0.00004055668,0.0003209716,0.0001272149,0.7264395,0.036661,0.2311699,0.00415253,0.00009110992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02044692,0.0001231705,0.975869,0.000255437,0.00003200124,0.0001661227,0.0001532066,0.000213192,0.002740921],"genre_scores_gemma":[0.2909079,0.0002442907,0.7049695,0.0001794457,0.00006347862,0.000386974,0.0005159727,0.00009231057,0.002640232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006317653,"threshold_uncertainty_score":0.02113461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02071208964858298,"score_gpt":0.2749125890897304,"score_spread":0.2542004994411475,"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."}}