{"id":"W2141090792","doi":"10.1109/icc.2011.5963254","title":"Tight Capacity Bounds for Discrete Memoryless Channels with Synchronization Errors, Additive Noise, and Large Alphabets","year":2011,"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":"McGill University","funders":"","keywords":"Synchronization (alternating current); Channel capacity; Upper and lower bounds; Noise (video); Mathematics; Capacity planning; Topology (electrical circuits); Computer science; Algorithm; Discrete mathematics; Channel (broadcasting); Combinatorics; Telecommunications; Mathematical analysis","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.003612091,0.001795239,0.001695803,0.002801465,0.001365848,0.004227994,0.002229132,0.001620948,0.004417835],"category_scores_gemma":[0.02662827,0.0009000358,0.000739408,0.002755203,0.005025785,0.005638047,0.003522665,0.00342562,0.0005936252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003867142,"about_ca_system_score_gemma":0.001815112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002983334,"about_ca_topic_score_gemma":0.001514091,"domain_scores_codex":[0.9969499,0.0007129513,0.0001038694,0.0003205062,0.0008965747,0.001016327],"domain_scores_gemma":[0.9650744,0.02922272,0.001514692,0.001575022,0.001757749,0.0008554365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003390026,0.00009714819,0.0004058637,0.0003213111,0.00005787136,0.0002831713,0.0003233483,0.5101377,0.006963016,0.4644451,0.004341151,0.01228529],"study_design_scores_gemma":[0.00004194987,0.00004773313,0.0001880868,0.0001137202,0.00002958387,0.00009493537,0.00007615187,0.6882566,0.003614541,0.30612,0.001358313,0.00005839836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1580558,0.008646715,0.78317,0.004900751,0.0003940639,0.00009631629,0.001308866,0.0009502139,0.04247719],"genre_scores_gemma":[0.9713,0.003208302,0.02034337,0.0004546809,0.0004435264,0.0002251437,0.0003491739,0.0001575346,0.003518196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004417835,"threshold_uncertainty_score":0.02805829,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01993528941690417,"score_gpt":0.2305397572176547,"score_spread":0.2106044678007505,"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."}}