{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007854889,0.000647265,0.0005614873,0.0006421217,0.0004802144,0.0009821343,0.0007898679,0.0008235243,0.00136887],"category_scores_gemma":[0.003318708,0.0002147263,0.0003599619,0.0006869186,0.0008942441,0.001151865,0.0009720594,0.0009642862,0.0005555043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006903083,"about_ca_system_score_gemma":0.00087864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009035553,"about_ca_topic_score_gemma":0.001045018,"domain_scores_codex":[0.9991487,0.0002790192,0.00003920554,0.00009507465,0.000356853,0.00008108639],"domain_scores_gemma":[0.9978192,0.001021738,0.000255006,0.0003886211,0.0004505952,0.00006479966],"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.0004735062,0.000150291,0.001651257,0.0007396433,0.0001119348,0.0007884233,0.0003993384,0.3844309,0.05255786,0.3589083,0.003352125,0.1964364],"study_design_scores_gemma":[0.00008307621,0.0002100791,0.0003634393,0.0000552766,0.00005769769,0.0005767883,0.00003693149,0.9057288,0.02166178,0.06342739,0.007721763,0.00007696707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02884483,0.0009024817,0.9655476,0.0003197696,0.0000768117,0.00006626991,0.00007912605,0.0002377314,0.00392543],"genre_scores_gemma":[0.7330688,0.001279517,0.2601202,0.0003024579,0.0001094175,0.0002250525,0.0001807034,0.00004923876,0.004664541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00136887,"threshold_uncertainty_score":0.005008578,"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."}}