{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002454293,0.00009499698,0.0001006309,0.00004366902,0.0001138637,0.0000836254,0.0006498456,0.00002693426,0.00005300628],"category_scores_gemma":[0.00001406402,0.00005898302,0.00009684808,0.0003812207,0.0001026194,0.00008790423,0.00006834856,0.00006282606,0.00002435615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008175145,"about_ca_system_score_gemma":0.00002000781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000018615,"about_ca_topic_score_gemma":0.00007549937,"domain_scores_codex":[0.9992072,0.00006436661,0.0001592298,0.000217907,0.0001838996,0.0001674107],"domain_scores_gemma":[0.9990785,0.0001992645,0.00006028594,0.0006025647,0.0000318563,0.00002756821],"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.00001635123,0.0001675277,0.0001911513,0.000002879769,0.000006134301,0.000002418952,0.00007219746,0.000008337216,0.00357525,0.9895149,0.005670773,0.0007720825],"study_design_scores_gemma":[0.001038426,0.00107544,0.004468282,0.0001063915,0.00002246876,0.00001142073,0.0001123963,0.01440083,0.1163348,0.6858401,0.1757752,0.0008142561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6320934,0.0001167077,0.3356695,0.001942184,0.0003077925,0.0001231557,0.000005969316,0.0001138848,0.02962748],"genre_scores_gemma":[0.9968454,0.000002086103,0.001562746,0.0006377766,0.00005515607,0.00001024815,4.459262e-7,0.00000454251,0.0008815794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3647521,"threshold_uncertainty_score":0.2405258,"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."}}