{"id":"W2768477051","doi":"10.1109/lcomm.2017.2777441","title":"An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Algorithm; Computer science; Variable (mathematics); Tree (set theory); Variable-length code; Theoretical computer science; Mathematics; Decoding methods; Combinatorics","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":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001742979,0.0001710131,0.000217264,0.0001036538,0.002075861,0.0003489318,0.01458853,0.00005840534,0.000001092231],"category_scores_gemma":[0.0003801408,0.0001458589,0.0001013831,0.0002357155,0.0005181166,0.0003957957,0.001082844,0.0003849346,0.000002102029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009415592,"about_ca_system_score_gemma":0.00007718572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007733809,"about_ca_topic_score_gemma":0.0003335486,"domain_scores_codex":[0.9983768,0.0002639432,0.000354747,0.0003601714,0.0003048665,0.0003394079],"domain_scores_gemma":[0.9858099,0.001782589,0.000386954,0.01168912,0.0002703378,0.00006115859],"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.000022516,0.000717199,0.002313173,0.00006608243,0.0001685972,0.000002579058,0.009167776,0.01108829,0.03810608,0.03326562,0.006825462,0.8982566],"study_design_scores_gemma":[0.0002595728,0.00006104822,0.001317751,0.00008468789,0.00002211678,0.000008603274,0.0002023182,0.9850057,0.01135763,0.000466064,0.001009033,0.0002054238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009018591,0.0001393917,0.9796441,0.009300294,0.0005515481,0.0005487552,0.00003094876,0.0003064979,0.0004598692],"genre_scores_gemma":[0.5325645,0.0000156617,0.4669592,0.0002608143,0.00003899423,0.0001239669,0.000003091697,0.00001532965,0.00001841651],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9739175,"threshold_uncertainty_score":0.9992233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05715061043160791,"score_gpt":0.3419300642919074,"score_spread":0.2847794538602995,"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."}}