{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002020738,0.0007603394,0.001059621,0.001126701,0.001234493,0.002187552,0.001420062,0.002113203,0.002922604],"category_scores_gemma":[0.01844406,0.0005872454,0.0004997813,0.001347035,0.001870819,0.002645578,0.001722133,0.001915972,0.0004843719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001890933,"about_ca_system_score_gemma":0.002978804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00109337,"about_ca_topic_score_gemma":0.00169558,"domain_scores_codex":[0.9979589,0.0006905864,0.0001315142,0.0003359789,0.0005330602,0.0003499485],"domain_scores_gemma":[0.9780024,0.01595119,0.001854538,0.0018624,0.001615287,0.0007141582],"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.005332523,0.0002380043,0.008088538,0.001390935,0.0002359154,0.0008690497,0.00116558,0.2523259,0.1167126,0.4857768,0.01066077,0.1172034],"study_design_scores_gemma":[0.0003562024,0.000617283,0.003256172,0.0003813215,0.000126764,0.0007159706,0.0002427821,0.5220492,0.04398654,0.4239708,0.004141299,0.0001555545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7676737,0.003643896,0.200464,0.004901434,0.0002267788,0.0001655584,0.002320212,0.0009192025,0.01968531],"genre_scores_gemma":[0.9546398,0.001242562,0.03928113,0.0002949996,0.0002096102,0.0002196818,0.0008785905,0.0002668907,0.002966769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002922604,"threshold_uncertainty_score":0.01371968,"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."}}