{"id":"W2141678038","doi":"10.1109/isit.2004.1365091","title":"Short-cycle-free interleaver design for increasing minimum squared euclidean distance","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Euclidean distance; Algorithm; Graph; Computer science; Mean squared error; Probability of error; Euclidean geometry; Minimum distance; Factor graph; Error detection and correction; Mathematics; Decoding methods; Theoretical computer science; Discrete mathematics; Statistics; Artificial intelligence","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.0008390384,0.0002316566,0.0002307274,0.0001365381,0.0001670851,0.0002266111,0.001914709,0.00008933321,0.000004381903],"category_scores_gemma":[0.0005635619,0.0002197461,0.000124478,0.0003334776,0.00005614929,0.0006158797,0.0004229085,0.0001467069,0.00001312338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002194227,"about_ca_system_score_gemma":0.00007922876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001341872,"about_ca_topic_score_gemma":0.0001402508,"domain_scores_codex":[0.998233,0.00009049285,0.0003548508,0.0006078947,0.0002585867,0.0004551477],"domain_scores_gemma":[0.9979461,0.0004628474,0.00008312859,0.00125217,0.0001376016,0.0001181686],"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.0006893282,0.0009834798,0.003720831,0.0002403849,0.000164687,0.0001751055,0.01073491,0.003705093,0.03038085,0.5189907,0.02942898,0.4007857],"study_design_scores_gemma":[0.002610946,0.001322139,0.002511665,0.0006442476,0.00004557383,0.0002272898,0.0003482919,0.1496203,0.2100181,0.6268265,0.003767103,0.002057905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0209473,0.00003596989,0.9731957,0.0008008436,0.0003633293,0.0005730443,0.000002291589,0.001700767,0.002380775],"genre_scores_gemma":[0.533439,0.000001473159,0.4661382,0.0002066693,0.0000387249,0.00004465363,8.810645e-7,0.00001798273,0.0001123685],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5124918,"threshold_uncertainty_score":0.8960987,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03224094315140034,"score_gpt":0.2800949596242964,"score_spread":0.2478540164728961,"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."}}