{"id":"W1993001665","doi":"10.1109/vetecf.2010.5594222","title":"Low-Density Parity-Check Codes for Two-Way Relay Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decodes; Relay; Relay channel; Code word; Computer science; Low-density parity-check code; Decoding methods; Single antenna interference cancellation; Parity bit; Interference (communication); Soft-decision decoder; Joint (building); Belief propagation; Channel (broadcasting); Algorithm; Theoretical computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.000571706,0.0001096398,0.0001403716,0.00004496986,0.0003450835,0.0002000721,0.0009616619,0.00005616315,0.00007152696],"category_scores_gemma":[0.0001167667,0.00009467666,0.00006649055,0.0002079128,0.00005235764,0.0002881127,0.0004404285,0.0002485611,0.00007368923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001255702,"about_ca_system_score_gemma":0.00003664438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001052515,"about_ca_topic_score_gemma":0.0004930315,"domain_scores_codex":[0.9991556,0.0000593141,0.0001693442,0.0002795744,0.000111112,0.0002250743],"domain_scores_gemma":[0.9985124,0.0002330721,0.00005144652,0.0008871135,0.0002187013,0.00009729786],"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.000007670821,0.0001177881,0.0003676247,0.000008400103,0.00001679086,0.000001366649,0.0006995628,0.00008240956,0.0328281,0.8908121,0.01094186,0.06411633],"study_design_scores_gemma":[0.001403516,0.0001239861,0.002465571,0.0000355552,0.000009629134,0.00002063693,0.00003350554,0.6978379,0.1834564,0.008799751,0.1051401,0.0006733706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08497265,0.0000492669,0.9013074,0.004442498,0.001002263,0.0002947876,0.000001105561,0.000292713,0.007637336],"genre_scores_gemma":[0.9319393,0.00004043408,0.06434848,0.001092536,0.0001398931,0.00003110079,0.000003730434,0.000006726277,0.002397806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8820124,"threshold_uncertainty_score":0.3860802,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03973839416307632,"score_gpt":0.2998498728562325,"score_spread":0.2601114786931562,"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."}}