{"id":"W3104878415","doi":"","title":"0 Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University; University of Alberta","funders":"","keywords":"Binary symmetric channel; Upper and lower bounds; Binary number; Hamming bound; Sphere packing; Binary code; Channel code; Combinatorics; Mathematics; Coding (social sciences); Channel (broadcasting); Code (set theory); Decoding methods; Algorithm; Discrete mathematics; Computer science; Block code; Linear code; Telecommunications; Mathematical analysis; Geometry; Statistics; Arithmetic","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.002627061,0.001714103,0.001753646,0.001813255,0.001365951,0.00374625,0.002126952,0.001801656,0.009439],"category_scores_gemma":[0.02019521,0.0006171974,0.000721817,0.002440705,0.00220527,0.005556278,0.00360468,0.00344229,0.002976033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002737184,"about_ca_system_score_gemma":0.002109178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001958216,"about_ca_topic_score_gemma":0.001759302,"domain_scores_codex":[0.9963155,0.0008008883,0.0001609448,0.0003914188,0.001684725,0.000646535],"domain_scores_gemma":[0.9867536,0.00839915,0.0009327976,0.00170417,0.001665326,0.0005448816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00102194,0.000250136,0.001067012,0.0007694402,0.00008848371,0.0004397269,0.0004437907,0.2304766,0.02230165,0.6084362,0.02127884,0.1134262],"study_design_scores_gemma":[0.00005705663,0.0002110259,0.0004037258,0.0001535252,0.00003319639,0.0002993958,0.00008964786,0.5571058,0.02010062,0.4120131,0.009452238,0.00008066311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1287859,0.005496243,0.7822808,0.00325071,0.001058643,0.0001740996,0.0008991017,0.002027615,0.07602684],"genre_scores_gemma":[0.842375,0.0028785,0.1360861,0.0009314424,0.0006395068,0.0003384023,0.0007861864,0.0005613126,0.01540354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009439,"threshold_uncertainty_score":0.03157657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03493126267689595,"score_gpt":0.2943571058584382,"score_spread":0.2594258431815422,"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."}}