{"id":"W2115973658","doi":"10.1109/icc.2011.5962486","title":"Raptor Coding for Non-Orthogonal Multiple Access Channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Decoding methods; Channel (broadcasting); Single antenna interference cancellation; Computer network; Digital Video Broadcasting; Coding (social sciences); Interference (communication); Channel capacity; Raptor code; Telecommunications; Concatenated error correction code; Block code; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001040289,0.0007975948,0.0006563024,0.0007013171,0.0007227028,0.0009557547,0.00105926,0.001017339,0.001978271],"category_scores_gemma":[0.003504814,0.0003229355,0.000449774,0.0007313985,0.001072991,0.001094045,0.001007744,0.001124342,0.0008930274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004930506,"about_ca_system_score_gemma":0.0008138802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000870649,"about_ca_topic_score_gemma":0.001071965,"domain_scores_codex":[0.998732,0.0005382713,0.00005133339,0.0001321012,0.0004191906,0.0001271261],"domain_scores_gemma":[0.9978147,0.001245726,0.0002035899,0.0003852039,0.0003170745,0.00003363485],"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.0003071304,0.00007511241,0.0003916943,0.0007823523,0.0001071821,0.0009431622,0.0004499384,0.1845377,0.0289691,0.5404112,0.006581983,0.2364435],"study_design_scores_gemma":[0.00006999224,0.0001973394,0.000213136,0.0001366717,0.00007287056,0.001090643,0.00005310908,0.8058609,0.01976291,0.1467,0.02574797,0.00009448244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009593645,0.002713123,0.9800569,0.0003439019,0.0001411451,0.00007150322,0.00008003355,0.0003825006,0.006617198],"genre_scores_gemma":[0.4723678,0.004219679,0.5142495,0.0005628994,0.0003389451,0.0005152266,0.0002684018,0.0001062916,0.007371322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001978271,"threshold_uncertainty_score":0.006618023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1062433292740942,"score_gpt":0.3146883759725378,"score_spread":0.2084450466984435,"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."}}