{"id":"W2743670993","doi":"10.1109/isit.2017.8006519","title":"On the capacity of burst noise-erasure channels with and without feedback","year":2017,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Erasure; Binary erasure channel; Channel capacity; Entropy (arrow of time); Computer science; Channel (broadcasting); Ergodic theory; Noise (video); Erasure code; Mutual information; Shannon–Hartley theorem; Control theory (sociology); Mathematics; Topology (electrical circuits); Algorithm; Decoding methods; Telecommunications; Combinatorics; Physics","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.0001314385,0.00008505715,0.0001134441,0.00002117845,0.0001201385,0.00005651775,0.0003582925,0.00004303913,0.00002230727],"category_scores_gemma":[0.00002668879,0.00005186498,0.00001353681,0.00002137874,0.0001578519,0.00009431119,0.00005170691,0.0001381799,0.000003770024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001039707,"about_ca_system_score_gemma":0.000003445372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001088178,"about_ca_topic_score_gemma":0.00009453552,"domain_scores_codex":[0.9996579,0.00001506805,0.00007968815,0.00006849175,0.0000982397,0.000080635],"domain_scores_gemma":[0.9989547,0.00004393141,0.00004269348,0.0008901624,0.0000430926,0.00002538741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002094938,0.0003805736,0.121541,0.0008107163,0.0007711088,0.000003171474,0.0145295,0.003661305,0.06739935,0.7612989,0.0178234,0.01157149],"study_design_scores_gemma":[0.001621898,0.0004412674,0.1813922,0.0009682298,0.00006662157,0.00002800572,0.0006073313,0.05034702,0.7405999,0.01622456,0.00652684,0.00117612],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9702901,0.00003248754,0.001890651,0.0007121156,0.0000212338,0.0001581082,0.000004253286,0.0001884991,0.02670261],"genre_scores_gemma":[0.9984463,0.00005665216,0.001319983,0.00003910662,0.00001119605,0.00001676398,5.347934e-7,0.00001532477,0.00009417232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7450743,"threshold_uncertainty_score":0.2114993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02958316630228077,"score_gpt":0.2421095472662474,"score_spread":0.2125263809639667,"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."}}