{"id":"W4361269916","doi":"10.1002/jcd.21882","title":"Ordered covering arrays and upper bounds on covering codes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"Ciência sem Fronteiras; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministério da Ciência, Tecnologia e Inovação; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Concatenation (mathematics); Cartesian product; Hamming code; Hamming distance; Discrete mathematics; Connection (principal bundle); Product (mathematics); Block code; Algorithm; Decoding methods; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.001797786,0.0009626087,0.0008102726,0.00238786,0.001179729,0.003305883,0.00113925,0.0008410279,0.008693211],"category_scores_gemma":[0.0126263,0.0004580458,0.0009210996,0.003152023,0.00225804,0.00541599,0.003195267,0.00278342,0.002277545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001638099,"about_ca_system_score_gemma":0.0007990421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005591252,"about_ca_topic_score_gemma":0.0005842163,"domain_scores_codex":[0.9955955,0.0009727105,0.0002841952,0.0005256147,0.001838011,0.000783854],"domain_scores_gemma":[0.9849703,0.009328312,0.0008854385,0.002471934,0.001874439,0.0004695235],"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.0001301094,0.00007055156,0.001062495,0.0002872636,0.00003230948,0.0001867745,0.000368824,0.04712965,0.009849048,0.8527041,0.004329149,0.08384975],"study_design_scores_gemma":[0.00001824997,0.0001565489,0.0008111639,0.0001610014,0.0000422,0.0006973344,0.0002078417,0.1225935,0.03233599,0.815992,0.02689838,0.00008578705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1092053,0.003672138,0.7964945,0.0009232643,0.0003112103,0.0001134209,0.0007870509,0.001209913,0.08728328],"genre_scores_gemma":[0.8041042,0.002680061,0.1798786,0.0004607163,0.0003589161,0.0003037862,0.0009599387,0.0004187547,0.01083505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008693211,"threshold_uncertainty_score":0.0290817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02489971877531201,"score_gpt":0.2561583306077486,"score_spread":0.2312586118324366,"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."}}