{"id":"W2027348201","doi":"10.1007/s11767-010-0315-9","title":"Joint iterative decoding for simple-encoding systematic irregular-LDPC-based coded cooperation in non-ideal relay channel","year":2010,"lang":"en","type":"article","venue":"Journal of Electronics (China)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Relay; Decoding methods; Relay channel; Computer science; Ideal (ethics); Joint (building); Encoding (memory); Theoretical computer science; Channel (broadcasting); Algorithm; Code (set theory); Simple (philosophy); Tanner graph; Topology (electrical circuits); Mathematics; Telecommunications; Error floor; Artificial intelligence; Combinatorics","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.001291764,0.0007702454,0.0008243938,0.0005537141,0.0006884785,0.0009376697,0.0007277473,0.0009285489,0.0009433558],"category_scores_gemma":[0.003069498,0.0003248655,0.0005400921,0.0008122892,0.001020233,0.0007426052,0.00130856,0.0005291432,0.0002876754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007328459,"about_ca_system_score_gemma":0.002733812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003122198,"about_ca_topic_score_gemma":0.00596991,"domain_scores_codex":[0.999114,0.0003232927,0.00005873184,0.0001057967,0.0002416208,0.0001565663],"domain_scores_gemma":[0.99813,0.000971024,0.0001597016,0.0002962628,0.0003814173,0.00006151047],"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.000799436,0.0001078498,0.0033273,0.0003791174,0.0002020545,0.0006691728,0.0009885632,0.7657329,0.0446297,0.1237829,0.001539669,0.05784141],"study_design_scores_gemma":[0.00002748891,0.00006695632,0.0003915536,0.00002275534,0.00003944645,0.000158773,0.00004006416,0.9746523,0.009624009,0.01447972,0.0004697341,0.00002732998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1913459,0.0003747184,0.7989174,0.0002913348,0.00004969605,0.0001110916,0.0002595972,0.0003306551,0.008319622],"genre_scores_gemma":[0.8918551,0.000201336,0.1049397,0.00005580841,0.00001504121,0.00008753943,0.000174884,0.0000335368,0.002637118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003122198,"threshold_uncertainty_score":0.006831586,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02070989556513358,"score_gpt":0.2797964660922415,"score_spread":0.2590865705271079,"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."}}