{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001772245,0.0005225393,0.0005222508,0.0003744829,0.0004296695,0.001072423,0.004124408,0.0003915158,0.0000251662],"category_scores_gemma":[0.0004895171,0.0003286639,0.0003595517,0.0005297992,0.0001078905,0.0004153875,0.005261635,0.0006548191,0.00001703114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003030538,"about_ca_system_score_gemma":0.0003482662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005430055,"about_ca_topic_score_gemma":0.00007037947,"domain_scores_codex":[0.9968023,0.0001622064,0.0005197427,0.001277589,0.0005208352,0.0007173851],"domain_scores_gemma":[0.9953861,0.001307173,0.0005853128,0.002304137,0.000315283,0.000102019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006929228,0.0003408789,0.000991299,0.001844477,0.0004699971,0.00006322678,0.003629882,0.0003897483,0.02076496,0.2016382,0.04150249,0.7282956],"study_design_scores_gemma":[0.0009423165,0.0004838152,0.0006243403,0.001824002,0.0001480865,0.000071789,0.0002438133,0.5855778,0.1313381,0.2712625,0.004519948,0.002963534],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0170879,0.0005987015,0.9680702,0.0009444991,0.004933541,0.001614591,0.00001377958,0.001960663,0.004776091],"genre_scores_gemma":[0.9027603,0.00003607524,0.09210184,0.000588173,0.0008200965,0.0005697338,0.000004903329,0.00009375372,0.003025111],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8856724,"threshold_uncertainty_score":0.9999645,"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."}}