{"id":"W2156362874","doi":"10.1109/bsc.2006.1644571","title":"A Lower Bound on the Minimum Distance of a 1-Generator Quasi-Cyclic Code","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Generator (circuit theory); Algorithm; Combinatorics; Physics; Computer science; Mathematics","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.001549307,0.001110228,0.001391056,0.001442431,0.001598302,0.002454792,0.003013892,0.002382951,0.0102102],"category_scores_gemma":[0.01843624,0.0006122817,0.0007638625,0.001461079,0.001650003,0.003464079,0.003009087,0.003010124,0.003578872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002372686,"about_ca_system_score_gemma":0.002611171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001300232,"about_ca_topic_score_gemma":0.001613434,"domain_scores_codex":[0.9962525,0.0007415047,0.0001777184,0.0007525972,0.001379262,0.0006964383],"domain_scores_gemma":[0.9806352,0.01335132,0.001070903,0.002120671,0.001600124,0.00122183],"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.005241722,0.0005148364,0.00883272,0.001903347,0.0002466872,0.00121217,0.001091747,0.1306038,0.06043682,0.5936952,0.03612043,0.1601007],"study_design_scores_gemma":[0.0004294451,0.001187021,0.003831945,0.0004090274,0.0001416311,0.002816562,0.0003167309,0.310066,0.03438573,0.6216274,0.0245561,0.0002324495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.497732,0.005579843,0.3757693,0.01084461,0.0008216129,0.0002810629,0.006688157,0.002330146,0.09995332],"genre_scores_gemma":[0.8722396,0.001585929,0.1029097,0.00113421,0.0005791671,0.0004969195,0.003989075,0.0005092259,0.01655622],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0102102,"threshold_uncertainty_score":0.0341565,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01277616600744143,"score_gpt":0.2217417485311823,"score_spread":0.2089655825237409,"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."}}