{"id":"W4246011204","doi":"10.1109/isit.1993.748393","title":"Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel","year":2005,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Adder; Binary number; Channel (broadcasting); Binary symmetric channel; Block (permutation group theory); Code (set theory); Block code; Computer science; Boundary (topology); Binary code; Mathematics; Discrete mathematics; Set (abstract data type); Combinatorics; Decoding methods; Algorithm; Arithmetic; Channel capacity; Telecommunications","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.002771414,0.002001919,0.001870109,0.002260611,0.001767236,0.003993517,0.002628401,0.001916026,0.008040259],"category_scores_gemma":[0.02172345,0.0009152523,0.001109109,0.00170983,0.003814503,0.007513898,0.004923508,0.004012297,0.001939759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003552857,"about_ca_system_score_gemma":0.002714754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001763216,"about_ca_topic_score_gemma":0.001889775,"domain_scores_codex":[0.9956633,0.0007682359,0.0001791425,0.0005348556,0.002007612,0.0008469378],"domain_scores_gemma":[0.9660256,0.02618503,0.001214423,0.002467476,0.003210826,0.0008965514],"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.0006721498,0.0001677627,0.001368467,0.0005258851,0.00009415006,0.0006401172,0.0005846526,0.2417591,0.03153197,0.6838161,0.004674753,0.0341648],"study_design_scores_gemma":[0.0000420939,0.0001586031,0.0004455529,0.0001767854,0.00006537213,0.000426828,0.000102557,0.6795087,0.03058851,0.2826947,0.00565262,0.0001376533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1137898,0.00403344,0.8111699,0.001801492,0.0002380021,0.0001769623,0.0009291082,0.001252756,0.06660853],"genre_scores_gemma":[0.8117524,0.003865022,0.1653149,0.0006550659,0.0003596858,0.0009278972,0.001307538,0.0005413104,0.01527611],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008040259,"threshold_uncertainty_score":0.02689731,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01712520353141347,"score_gpt":0.2730596928115211,"score_spread":0.2559344892801076,"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."}}