{"id":"W2004251193","doi":"10.1016/j.jda.2012.04.006","title":"Quasi-cyclic codes over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math> and enumeration of defining polynomials","year":2012,"lang":"lv","type":"article","venue":"Journal of Discrete Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hamming distance; Mathematics; Circulant matrix; Hamming code; Combinatorics; Minimum distance; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code","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","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003588916,0.0007187771,0.000444773,0.0006712505,0.001279066,0.001671548,0.00194736,0.001378639,0.1254686],"category_scores_gemma":[0.0007921825,0.001216485,0.001657496,0.001110555,0.001167699,0.003082277,0.001453715,0.001452242,0.0003899079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001582717,"about_ca_system_score_gemma":0.001069647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000823155,"about_ca_topic_score_gemma":0.0003147282,"domain_scores_codex":[0.9920916,0.0005763043,0.002125989,0.001091516,0.002245927,0.001868687],"domain_scores_gemma":[0.9925372,0.001430631,0.003175974,0.001583582,0.0002005616,0.001072032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00223379,0.0004816898,0.0001148728,0.0008387512,0.002246765,0.000756134,0.005841002,0.0008689479,0.006385208,0.8777435,0.09299895,0.009490365],"study_design_scores_gemma":[0.002990435,0.002685714,0.0005992823,0.001574495,0.001493579,0.002558395,0.001693198,0.08677646,0.8959108,0.0003906809,0.001956357,0.001370621],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.787428,0.004059608,0.01056052,0.0006771387,0.004113636,0.00004369491,0.0002877717,0.0001143137,0.1927153],"genre_scores_gemma":[0.9843287,0.001473463,0.01026217,0.0008677859,0.002280815,0.0001479656,0.0001981792,0.0003351452,0.0001057736],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8895256,"threshold_uncertainty_score":0.9999178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01873549912518667,"score_gpt":0.2489108541747267,"score_spread":0.23017535504954,"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."}}