{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009464664,0.00009818746,0.00009709179,0.00007352849,0.0004498529,0.0001413098,0.0006825074,0.00004084818,0.00001638009],"category_scores_gemma":[0.00005743163,0.00006550088,0.00006126208,0.0003503297,0.00003567526,0.0002633347,0.0002233316,0.00009107671,0.000008802721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005002333,"about_ca_system_score_gemma":0.00002404609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001183523,"about_ca_topic_score_gemma":0.0001893768,"domain_scores_codex":[0.9991807,0.00005326864,0.0002236957,0.0002023542,0.0001229521,0.0002170036],"domain_scores_gemma":[0.9985729,0.0005242928,0.00007524987,0.0005962163,0.0001869012,0.00004439818],"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.0001097165,0.0001980217,0.0005791122,0.00002116473,0.0001421981,0.000002667187,0.006331676,0.06676426,0.07644732,0.4968057,0.004473952,0.3481243],"study_design_scores_gemma":[0.0002375554,0.00002322481,0.001047932,0.00001578364,0.000004213694,0.000003384584,0.0000703993,0.9874252,0.005817346,0.0006983282,0.004550843,0.000105752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01507342,0.0002383399,0.980976,0.001648826,0.0002447693,0.0003121382,5.452614e-7,0.0001217918,0.001384188],"genre_scores_gemma":[0.9497878,0.00007155607,0.04851672,0.0008185134,0.00007329279,0.00001127882,0.000002035955,0.000008018252,0.0007107879],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9347144,"threshold_uncertainty_score":0.345995,"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."}}