{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006096904,0.0006107995,0.0007832876,0.001541594,0.0007843886,0.001006193,0.001300422,0.0009623001,0.003615453],"category_scores_gemma":[0.005128291,0.0003193677,0.0005316946,0.001761472,0.0006404265,0.001518016,0.001095763,0.0008805462,0.001340691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009323749,"about_ca_system_score_gemma":0.002498573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004293413,"about_ca_topic_score_gemma":0.005948523,"domain_scores_codex":[0.9990909,0.0001447968,0.0000637128,0.0001523344,0.0004499663,0.00009829645],"domain_scores_gemma":[0.9979202,0.0009700532,0.0001565186,0.0002234844,0.0006715948,0.00005818024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002680308,0.000105336,0.001650047,0.0003093109,0.00007695656,0.0002208926,0.0003529282,0.2824638,0.02720689,0.07696303,0.0105406,0.5998422],"study_design_scores_gemma":[0.00006861304,0.00009167362,0.0002668815,0.00002739724,0.00001924993,0.0002167035,0.00006936915,0.9410313,0.01181223,0.03978625,0.006577433,0.00003297425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009906654,0.0001923636,0.9872556,0.00009778616,0.00004234776,0.0000538554,0.0001186169,0.0008861292,0.001446693],"genre_scores_gemma":[0.09101362,0.0001396126,0.9060731,0.00007234881,0.00002208221,0.0001271221,0.0004819097,0.0001881653,0.001882002],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004293413,"threshold_uncertainty_score":0.01209486,"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."}}