{"id":"W2163096389","doi":"10.1109/icc.2006.255035","title":"Bilayer LDPC Codes for the Relay Channel","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Relay; Computer science; Relay channel; Channel (broadcasting); Algorithm; Channel capacity; Decoding methods; EXIT chart; Electronic engineering; Block code; Concatenated error correction code; Computer network; Physics; Engineering","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004433276,0.000160695,0.0001288475,0.0001256064,0.0008176308,0.0003822972,0.005547112,0.00005032975,0.00006088381],"category_scores_gemma":[0.00007357289,0.0001258692,0.0001065086,0.0002829559,0.0001757064,0.0002980308,0.0004962078,0.0002713671,0.000107008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000837047,"about_ca_system_score_gemma":0.00009063155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006731245,"about_ca_topic_score_gemma":0.0006416024,"domain_scores_codex":[0.9987684,0.0001515908,0.0003466191,0.0002621567,0.0002662845,0.0002048711],"domain_scores_gemma":[0.9958803,0.0009549969,0.0001704337,0.002348804,0.0006041176,0.00004132798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006466021,0.0001340549,0.00004672095,0.000001032128,0.00002929905,1.762686e-7,0.000113605,0.001596028,0.001706073,0.9760464,0.01480287,0.005517283],"study_design_scores_gemma":[0.0004379407,0.00004038264,0.001680948,0.00005362467,0.00001123254,0.000006023632,0.00005124119,0.7874427,0.001047103,0.01217031,0.1968005,0.0002580104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006467367,0.0007507734,0.8011792,0.09909323,0.0008036245,0.0005932191,0.00006628709,0.0002350196,0.09663185],"genre_scores_gemma":[0.9785933,0.001948845,0.01393575,0.001252851,0.0001380831,0.0004175579,0.00007294401,0.00001297652,0.003627631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9779466,"threshold_uncertainty_score":0.9998333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1688634495766887,"score_gpt":0.3661864784126546,"score_spread":0.1973230288359659,"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."}}