{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001898669,0.0001223491,0.0001237057,0.00003424027,0.00005986715,0.0000233848,0.0001396159,0.0001703913,0.00004787717],"category_scores_gemma":[0.00004429676,0.0000908678,0.00007315586,0.00006505206,0.00003929946,0.000003737932,0.0001107757,0.00005787905,0.00001214828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001151279,"about_ca_system_score_gemma":0.00003207459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000168393,"about_ca_topic_score_gemma":0.000126854,"domain_scores_codex":[0.9991733,0.00002938409,0.0001685777,0.0002909121,0.00004195696,0.0002958863],"domain_scores_gemma":[0.9997072,0.00002209677,0.00003056242,0.0001425087,0.00004519545,0.00005250238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004670118,0.000609066,0.01502073,0.00004888291,0.00007906617,0.000006405838,0.00008069634,0.0007169048,0.9387804,0.002717824,0.02767424,0.01379882],"study_design_scores_gemma":[0.001981616,0.001292289,0.008788861,0.0000361427,0.0000144525,0.00001711422,0.0001649606,0.005598024,0.4575096,0.001856279,0.5220401,0.0007005416],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9919806,0.0004553083,0.002655318,0.0006476266,0.00005388691,0.0002256434,0.000007957572,0.0000216504,0.003952072],"genre_scores_gemma":[0.9870504,0.00005492937,0.005655954,0.002068545,0.00018582,0.0000344797,0.00008055585,0.00001202528,0.004857248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4943659,"threshold_uncertainty_score":0.3705482,"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."}}