{"id":"W1634602415","doi":"10.1109/isit.1993.748414","title":"On the minimum Code Length of s-step (T, U) Permutation Decodable Cyclic Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Permutation (music); Code (set theory); Computer science; Combinatorics; Cyclic code; Mathematics; Discrete mathematics; Algorithm; Concatenated error correction code; Block code; Decoding methods; Physics; Programming language","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.0004058119,0.0000840665,0.00009284962,0.00007584759,0.0001199853,0.00005392941,0.0005804769,0.00002970375,0.0001391537],"category_scores_gemma":[0.00004452934,0.0000537857,0.00007537068,0.0002844916,0.00005928841,0.0001946037,0.00006608433,0.00007037647,0.00007219682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001025183,"about_ca_system_score_gemma":0.00001679748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007682568,"about_ca_topic_score_gemma":0.00004267751,"domain_scores_codex":[0.999242,0.00008829821,0.000160645,0.0001836884,0.0001746289,0.0001507481],"domain_scores_gemma":[0.9989212,0.0005158963,0.00006451151,0.0004254454,0.00003956581,0.00003344913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001001826,0.00006880333,0.0001058105,0.000002955399,0.00001187606,3.935616e-7,0.000474438,0.0002444896,0.001213148,0.9747363,0.002337348,0.02079437],"study_design_scores_gemma":[0.001354476,0.0008585346,0.004945327,0.0001052312,0.00004096237,0.00002509312,0.0008219698,0.421387,0.1461729,0.3778866,0.04563242,0.0007695598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.570993,0.0000655121,0.3739669,0.003596296,0.0001135248,0.0001429135,0.000003087334,0.0001499038,0.05096886],"genre_scores_gemma":[0.9879674,0.000008699856,0.01060235,0.0009129547,0.00002831216,0.000008054632,7.24471e-7,0.000004175749,0.0004672725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5968498,"threshold_uncertainty_score":0.2193317,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01528392589571473,"score_gpt":0.2419964056220726,"score_spread":0.2267124797263579,"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."}}