{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000362068,0.0001332993,0.0001425185,0.0001239101,0.0001298032,0.0001372402,0.001475145,0.00006223376,0.00003664628],"category_scores_gemma":[0.0001135155,0.0001202551,0.00008945879,0.0001854154,0.00002225627,0.0007974627,0.0004520706,0.0000864605,0.00001870734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002410178,"about_ca_system_score_gemma":0.00004009248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008451374,"about_ca_topic_score_gemma":0.00003351938,"domain_scores_codex":[0.9989485,0.00001760839,0.0001889546,0.000388021,0.0001411418,0.0003157955],"domain_scores_gemma":[0.9990758,0.0001783342,0.00008388686,0.0004535555,0.0001264806,0.00008193556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002629737,0.001222138,0.09989218,0.0003722275,0.0002216745,0.00006675073,0.02293881,0.00005113865,0.0538444,0.4992378,0.08104886,0.2408411],"study_design_scores_gemma":[0.000719624,0.000323036,0.005906445,0.00006905254,0.000009104366,0.00002310948,0.00004713453,0.3571189,0.6155133,0.01708705,0.002497699,0.0006855709],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01914953,0.000004861615,0.9691015,0.0001007003,0.000946079,0.0004054948,0.000001498622,0.0009885936,0.009301777],"genre_scores_gemma":[0.7281184,0.000001537143,0.2710492,0.0002638273,0.000073293,0.0001068116,9.06078e-7,0.00001136628,0.0003746701],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7089689,"threshold_uncertainty_score":0.4903862,"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."}}