{"id":"W1982408478","doi":"10.1109/isit.2007.4557204","title":"Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Channel (broadcasting); Noise power; Noise (video); Mathematics; Decoding methods; Bit error rate; Algorithm; Channel state information; Transmission (telecommunications); Fading distribution; Power (physics); Statistics; Computer science; Control theory (sociology); Telecommunications; Rayleigh fading; Physics; Wireless","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001121196,0.000373206,0.000362052,0.0005230613,0.0002025295,0.000340484,0.001073048,0.0003936462,0.000006949431],"category_scores_gemma":[0.0002670131,0.0003633579,0.0002230881,0.0002463564,0.00002057248,0.0002777921,0.001008584,0.0006068662,0.00001725497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003160207,"about_ca_system_score_gemma":0.00008501579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000042902,"about_ca_topic_score_gemma":0.00001100893,"domain_scores_codex":[0.9977201,0.00006379858,0.000456932,0.000986602,0.0003314595,0.0004410832],"domain_scores_gemma":[0.9978784,0.0005559426,0.0003091343,0.0008356727,0.0003257673,0.00009512847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001752314,0.0004872872,0.0006070274,0.0008570178,0.000336907,0.00008669517,0.02612134,0.3969591,0.003914625,0.2688126,0.014378,0.2872642],"study_design_scores_gemma":[0.0001280271,0.0001451343,0.00002605568,0.0003705026,0.000008380407,0.000004950373,0.00001388995,0.9433117,0.04611672,0.008857733,0.0005766996,0.0004402045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004543492,0.00002600115,0.9832498,0.0003954451,0.002468187,0.001095761,0.000004291058,0.00162738,0.006589581],"genre_scores_gemma":[0.3949097,0.00000516034,0.6033317,0.0003752407,0.0003938034,0.0001214405,0.00001934023,0.00003044755,0.0008131439],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5463526,"threshold_uncertainty_score":0.9998819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07289412940617145,"score_gpt":0.3642338397936453,"score_spread":0.2913397103874739,"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."}}