{"id":"W4248623970","doi":"10.1109/isit.1991.695146","title":"Exact Lower Bounds On The Code Length Of Three-step Permutation-decodable Cyclic Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Permutation (music); Cyclic code; Code (set theory); Computer science; Upper and lower bounds; Mathematics; Algorithm; Combinatorics; Block code; Linear 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.0005344683,0.0001276161,0.0001358214,0.00009280223,0.0002127766,0.0001224483,0.0008282269,0.00004234127,0.0003725083],"category_scores_gemma":[0.00003854281,0.00008132237,0.0001233139,0.0003795344,0.000111587,0.0002924337,0.00009762919,0.0001179845,0.0001149132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001748707,"about_ca_system_score_gemma":0.00003290195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002600055,"about_ca_topic_score_gemma":0.0002385444,"domain_scores_codex":[0.9989724,0.0000752578,0.0002095191,0.000258907,0.0002626232,0.0002213184],"domain_scores_gemma":[0.9986496,0.0004938725,0.00008196537,0.0006667265,0.00005811191,0.00004973016],"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.00002023044,0.0001525256,0.0007302542,0.000004407117,0.00003164144,0.000001223856,0.0004018275,0.0003483304,0.0005461276,0.971993,0.002465238,0.02330523],"study_design_scores_gemma":[0.001941421,0.001703168,0.02661497,0.0001870341,0.00007728182,0.00003888823,0.0005771506,0.3584777,0.04651509,0.3925076,0.1698969,0.001462814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5160732,0.0001031574,0.3959474,0.004394024,0.0002617539,0.0002008975,0.000005471123,0.0002284741,0.08278566],"genre_scores_gemma":[0.9918623,0.00001211104,0.006454412,0.0009824693,0.00005875491,0.00001132904,8.802139e-7,0.000007462552,0.0006102794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5794854,"threshold_uncertainty_score":0.4078705,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01943049060702937,"score_gpt":0.2445610805298945,"score_spread":0.2251305899228651,"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."}}