{"id":"W2135863246","doi":"10.1109/cwit.2007.375711","title":"Bit-Interleaved Coded Modulation for the Relay Channel Using Bilayer LDPC Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Relay; Concatenation (mathematics); Computer science; Bit error rate; Algorithm; Decoding methods; Channel (broadcasting); Modulation (music); Coding (social sciences); Code (set theory); Parity bit; Forward error correction; Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Physics; Electrical engineering; Arithmetic; Engineering; Statistics","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.0004158685,0.000456792,0.0003385609,0.0004142571,0.0004421146,0.0005531652,0.000469184,0.0005378982,0.001058805],"category_scores_gemma":[0.001802327,0.0001312945,0.0002500248,0.0005593147,0.0005957411,0.0006185416,0.0006065976,0.0006949337,0.0005431297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005424859,"about_ca_system_score_gemma":0.0006421706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006335715,"about_ca_topic_score_gemma":0.0009765774,"domain_scores_codex":[0.9996978,0.000110501,0.00001541889,0.00002354922,0.000124713,0.00002814398],"domain_scores_gemma":[0.9992892,0.0002813582,0.00008279365,0.0001846056,0.0001414209,0.0000206541],"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.0004978575,0.0001304728,0.0009776643,0.0007547908,0.00005706377,0.000495734,0.0004228275,0.1750344,0.2045839,0.4093877,0.003620735,0.2040368],"study_design_scores_gemma":[0.00003524455,0.000201595,0.0002334171,0.00007501095,0.00004090279,0.0004878671,0.0000326327,0.8823899,0.07059844,0.03358112,0.01226583,0.00005804402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04810692,0.001045657,0.9427146,0.0004308322,0.00008845313,0.0001145394,0.0001480037,0.0004009779,0.006949967],"genre_scores_gemma":[0.5775654,0.0009975603,0.4184816,0.0001365461,0.00006038534,0.0001539499,0.0001536219,0.00004651546,0.002404526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001058805,"threshold_uncertainty_score":0.003936052,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1031729607311798,"score_gpt":0.3323976888637922,"score_spread":0.2292247281326124,"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."}}