{"id":"W2069390698","doi":"10.1007/s10801-009-0191-2","title":"Bounds on permutation codes of distance four","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamming distance; Permutation (music); Bit-reversal permutation; Minimum distance; Partial permutation; Permutation graph; Hamming code; Discrete mathematics; Set (abstract data type); Hamming graph; Upper and lower bounds; Cyclic permutation; Hamming bound; Symmetric group; Block code; Algorithm; Decoding methods; Graph; Computer science","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.005759072,0.004559519,0.003856056,0.006965712,0.004572054,0.01106678,0.007092633,0.003896483,0.01766064],"category_scores_gemma":[0.04038099,0.001989401,0.00182845,0.009692769,0.00754847,0.01426095,0.01293205,0.009975703,0.005476012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009388389,"about_ca_system_score_gemma":0.0056334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003934553,"about_ca_topic_score_gemma":0.004549101,"domain_scores_codex":[0.9914706,0.001604297,0.0003771531,0.0009236819,0.003443427,0.00218084],"domain_scores_gemma":[0.92628,0.05768904,0.002218122,0.006762721,0.004029376,0.003020772],"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.002113808,0.000336286,0.002607474,0.0006410631,0.0001521385,0.0004637793,0.001331345,0.05467711,0.007584063,0.827515,0.02256553,0.0800124],"study_design_scores_gemma":[0.0001423702,0.0002055129,0.0006582979,0.0002391832,0.0001311689,0.0004009849,0.000240129,0.08020595,0.005076811,0.9012691,0.01130859,0.0001219545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3247678,0.01459519,0.3699796,0.02340507,0.001756191,0.0004396329,0.003923109,0.003480805,0.2576528],"genre_scores_gemma":[0.8783606,0.007035631,0.07301877,0.002896982,0.001647667,0.0008330893,0.002909246,0.001083645,0.03221425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01766064,"threshold_uncertainty_score":0.06811786,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007109176898238282,"score_gpt":0.2014739093087451,"score_spread":0.1943647324105068,"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."}}