{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003181829,0.0002577965,0.0006314971,0.0004613012,0.0004063011,0.000409296,0.001013414,0.0001261724,0.000008682755],"category_scores_gemma":[0.0006953955,0.0002231327,0.0002114751,0.0006603147,0.00003584394,0.0008384538,0.0001233784,0.001043935,0.000002750556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003297712,"about_ca_system_score_gemma":0.0005206401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002556028,"about_ca_topic_score_gemma":0.0003099396,"domain_scores_codex":[0.997484,0.0003369348,0.001045439,0.0002828161,0.0003512072,0.0004995804],"domain_scores_gemma":[0.9974059,0.0004181507,0.0008751049,0.0005541862,0.0006044658,0.0001421598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004242337,0.001054722,0.0005002498,0.002781305,0.0004038713,0.00008540117,0.01575655,0.1284171,0.4947035,0.3406159,0.003903687,0.01135354],"study_design_scores_gemma":[0.001590468,0.0004979678,0.0003509939,0.001016059,0.00002605434,0.00008387893,0.00003762452,0.9819869,0.01244804,0.001485334,0.0002088679,0.0002678092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1550507,0.0008046951,0.8401885,0.002544048,0.0005116859,0.0007359055,0.000001576721,0.0000306963,0.0001321767],"genre_scores_gemma":[0.9759854,0.0001734643,0.02332341,0.0002412667,0.0001462035,0.00004897687,0.000006111172,0.00002276259,0.00005241241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8535698,"threshold_uncertainty_score":0.9099088,"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."}}