{"id":"W2108236351","doi":"10.1109/18.841196","title":"The capacity-cost function of discrete additive noise channels with and without feedback","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Aperiodic graph; Markov chain; Mathematics; Noise (video); Function (biology); Channel capacity; Markov process; Topology (electrical circuits); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Statistics","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.0002368143,0.0001285789,0.0001123498,0.0001061265,0.0002333053,0.00005733835,0.000129676,0.00006687408,0.0001357804],"category_scores_gemma":[0.000002696146,0.0000960067,0.000034603,0.0001703673,0.0001859513,0.0009282267,7.466924e-7,0.0002383751,0.0000429319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003694907,"about_ca_system_score_gemma":0.000009928247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000725578,"about_ca_topic_score_gemma":0.00001187257,"domain_scores_codex":[0.9993479,0.00006261263,0.0002611502,0.00005595045,0.0001503818,0.0001219654],"domain_scores_gemma":[0.9993664,0.0001333799,0.00005979477,0.000317747,0.00007979661,0.0000428543],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001055164,0.00005444722,0.000009316685,0.0001163142,0.0002630248,8.074663e-8,0.01208893,0.1152026,0.0004362081,0.01353325,0.0003380435,0.8569026],"study_design_scores_gemma":[0.006532038,0.001703899,0.003747522,0.001256605,0.0005241072,0.0001079919,0.01225481,0.2248747,0.5652953,0.01995947,0.1611371,0.002606409],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09497225,0.0000335045,0.8941693,0.00006522883,0.0001141806,0.0004955102,0.0001257591,0.0004185106,0.009605731],"genre_scores_gemma":[0.9987082,0.0005486485,0.0003647296,0.00005833535,0.000009051885,0.0001725596,0.00001208926,0.00001451237,0.000111911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9037359,"threshold_uncertainty_score":0.391504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007147524987580594,"score_gpt":0.2012612449204612,"score_spread":0.1941137199328806,"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."}}