{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003555698,0.000326849,0.0002519008,0.0003741668,0.0003291047,0.0004927849,0.0004104686,0.0005192635,0.00160703],"category_scores_gemma":[0.001888314,0.0001586294,0.0002568176,0.0004142419,0.0005570305,0.0006480943,0.0005571839,0.0008197642,0.0006328184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004951674,"about_ca_system_score_gemma":0.0008215569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001150839,"about_ca_topic_score_gemma":0.001098589,"domain_scores_codex":[0.9996972,0.00007796191,0.00001408164,0.00003821273,0.000144086,0.00002850403],"domain_scores_gemma":[0.9994154,0.0002062073,0.00006665215,0.0001486732,0.0001443464,0.00001874507],"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.0001158558,0.00003874346,0.0003359629,0.0001684606,0.00001569633,0.000141513,0.0001522998,0.213131,0.04858866,0.6556934,0.001960212,0.07965817],"study_design_scores_gemma":[0.0000204452,0.00005906099,0.0001612627,0.00002898981,0.00001083762,0.000185594,0.00001579586,0.8779392,0.019408,0.08974302,0.01239946,0.00002839572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01202808,0.0002041542,0.9833128,0.000129098,0.0000336146,0.00005367399,0.00009632072,0.0002239133,0.003918272],"genre_scores_gemma":[0.3862749,0.0007682892,0.608578,0.0001414222,0.00003771207,0.0002019257,0.0001842191,0.00008436794,0.003729082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00160703,"threshold_uncertainty_score":0.005376041,"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."}}