{"id":"W2169154778","doi":"10.48550/arxiv.0805.4440","title":"Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Binary erasure channel; Erasure code; Mathematics; Alphabet; Decoding methods; Separable space; Discrete mathematics; Block code; Channel (broadcasting); Algorithm; Combinatorics; Coding (social sciences); Channel capacity; Computer science; Statistics; 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.001462229,0.0006508912,0.0007292183,0.0008903302,0.0005670097,0.001175726,0.0007193132,0.0008883757,0.00127907],"category_scores_gemma":[0.006923803,0.0003389389,0.000312189,0.0008213385,0.001868778,0.001881613,0.001229076,0.0009895684,0.0001837835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001727872,"about_ca_system_score_gemma":0.00138143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002056394,"about_ca_topic_score_gemma":0.001916909,"domain_scores_codex":[0.9992276,0.0002662795,0.00003007541,0.0000908541,0.0002124784,0.0001726968],"domain_scores_gemma":[0.9943071,0.004540213,0.0004324909,0.0002484221,0.0003744401,0.0000973026],"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.0002693995,0.00004755482,0.00044939,0.0001384299,0.00002883103,0.0002742506,0.0002452723,0.5915484,0.006732498,0.3851934,0.001375203,0.0136973],"study_design_scores_gemma":[0.00003443291,0.00004392254,0.0001710416,0.00002891677,0.00001411386,0.0000735553,0.00005127261,0.8785647,0.002071672,0.118142,0.0007800608,0.00002438125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2879746,0.001942646,0.6961039,0.001633017,0.0001234524,0.00007912918,0.0003066387,0.0002125206,0.01162401],"genre_scores_gemma":[0.9635397,0.0009876124,0.03189986,0.0001158857,0.00007799424,0.00007860566,0.0001044828,0.00003396201,0.003161999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002056394,"threshold_uncertainty_score":0.01253659,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08768192245977054,"score_gpt":0.2857536612973288,"score_spread":0.1980717388375582,"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."}}