{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009110195,0.0004079294,0.0003010575,0.001007463,0.0008718445,0.001793347,0.0005057407,0.0004851695,0.01425495],"category_scores_gemma":[0.004422649,0.0003045732,0.000314378,0.00145002,0.0008932086,0.002067002,0.001173069,0.001056082,0.004598069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001021454,"about_ca_system_score_gemma":0.001456931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001979247,"about_ca_topic_score_gemma":0.002449914,"domain_scores_codex":[0.999086,0.0002642256,0.0000712522,0.000134327,0.0002383144,0.0002059084],"domain_scores_gemma":[0.9968003,0.001542341,0.0003667157,0.00053406,0.0005596986,0.0001968842],"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.0001832138,0.00005329699,0.0006900457,0.000107635,0.000006841202,0.0001640003,0.0003433431,0.003067693,0.004250405,0.9225018,0.01733289,0.05129882],"study_design_scores_gemma":[0.00009495691,0.0001369426,0.001664982,0.0001457489,0.0000205667,0.0008133726,0.000186953,0.02387108,0.01437598,0.8690401,0.0895603,0.0000889747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2849333,0.001164083,0.4505074,0.003853684,0.0006641746,0.0003314629,0.006559671,0.002482437,0.2495038],"genre_scores_gemma":[0.8173981,0.001270275,0.08204087,0.0007855844,0.0005475734,0.0002796149,0.004787903,0.0008501763,0.09203982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01425495,"threshold_uncertainty_score":0.04768759,"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."}}