{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004614556,0.0003523443,0.0003502714,0.00005618371,0.0007702885,0.0002021477,0.00273893,0.0001600802,0.00001427978],"category_scores_gemma":[0.0001196113,0.0002447137,0.0001685298,0.0002774627,0.0001407462,0.0002258788,0.001859497,0.0008798637,0.00001982767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006045287,"about_ca_system_score_gemma":0.0002637658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006877986,"about_ca_topic_score_gemma":0.00001703663,"domain_scores_codex":[0.9982393,0.0001445356,0.0003120272,0.0006480617,0.0002587919,0.0003972457],"domain_scores_gemma":[0.9965364,0.001039278,0.0002312432,0.00181487,0.0002797475,0.00009842071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001276694,0.002687172,0.1482832,0.00156761,0.006804253,0.0004591348,0.07876413,0.3106602,0.004667745,0.08277754,0.1755016,0.1865507],"study_design_scores_gemma":[0.002666454,0.0004657776,0.1129226,0.001136064,0.0001608946,0.0001371028,0.0002095476,0.798736,0.003290839,0.0007253666,0.07716445,0.002384882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1595953,0.005097988,0.8172612,0.01255376,0.001193653,0.001612101,0.00001849982,0.0004916895,0.002175896],"genre_scores_gemma":[0.9677579,0.005448157,0.0233997,0.00190025,0.0003990617,0.0003689972,0.00001755922,0.00003796067,0.0006703699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8081627,"threshold_uncertainty_score":0.9979137,"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."}}