{"id":"W2484401148","doi":"10.1109/icc.2016.7511175","title":"BICM-ID in two-way relaying communications","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decoding methods; Relay; Computer science; Algorithm; Bit error rate; Interference (communication); Coding (social sciences); Upper and lower bounds; Phase-shift keying; Code (set theory); Theoretical computer science; Telecommunications; Mathematics; Channel (broadcasting); 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.001127193,0.0007346873,0.0007182854,0.0007834391,0.0004946801,0.0009346522,0.000880485,0.001116305,0.0004464796],"category_scores_gemma":[0.003239369,0.000346436,0.0003056932,0.0009092743,0.001144224,0.0009845148,0.0009939881,0.0007538817,0.0003258043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007521585,"about_ca_system_score_gemma":0.0006754234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00108423,"about_ca_topic_score_gemma":0.0009774063,"domain_scores_codex":[0.9987254,0.0005159804,0.0000439002,0.0001074609,0.0004865766,0.0001206588],"domain_scores_gemma":[0.9985266,0.0008416999,0.0001525319,0.0001660644,0.0002828579,0.00003036766],"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.0002467533,0.00008353039,0.001865649,0.0005926984,0.00008971106,0.001027574,0.0008611963,0.5180728,0.03040086,0.3454495,0.002088069,0.09922168],"study_design_scores_gemma":[0.00001543795,0.0001829656,0.0002720832,0.00004458391,0.00002022437,0.0005805632,0.00006144511,0.9548352,0.006480385,0.03492421,0.002539536,0.00004340819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05487865,0.004750171,0.9295801,0.0003195493,0.00009004764,0.00006049295,0.00004497719,0.0001566487,0.01011937],"genre_scores_gemma":[0.8830109,0.002363755,0.1118094,0.0001484562,0.00008902266,0.0001037399,0.000043038,0.00001832918,0.002413379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001127193,"threshold_uncertainty_score":0.005961239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07400031242674611,"score_gpt":0.3346696766742477,"score_spread":0.2606693642475016,"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."}}