{"id":"W2317118221","doi":"10.1109/milcom.2014.143","title":"On Faster-than-Nyquist Transmission over a Multiple-Access Channel","year":2014,"lang":"en","type":"article","venue":"","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Transmission (telecommunications); Channel (broadcasting); Decoding methods; Computer science; Nyquist–Shannon sampling theorem; Demodulation; Channel capacity; Signal-to-noise ratio (imaging); Electronic engineering; Telecommunications; Computer network; Topology (electrical circuits); Engineering; Electrical engineering","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.00006749785,0.0001532346,0.0001284592,0.00009450334,0.00004737708,0.00005103389,0.0001764146,0.00007675043,0.0005287312],"category_scores_gemma":[0.00002189879,0.0001348194,0.00005853084,0.0001069815,0.00001923355,0.0001587495,0.00001609463,0.0001209843,0.0002092438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003633253,"about_ca_system_score_gemma":0.000003203392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002384427,"about_ca_topic_score_gemma":0.000006929793,"domain_scores_codex":[0.9992805,0.00001712393,0.0001537697,0.0001732859,0.0001559145,0.0002194188],"domain_scores_gemma":[0.9995744,0.00006395325,0.00001435105,0.0002237741,0.00001447537,0.0001090677],"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.0002410189,0.0004081401,0.001309251,0.0007713215,0.0002157304,0.00001407965,0.00199569,0.6821288,0.1081071,0.006966843,0.1035349,0.09430715],"study_design_scores_gemma":[0.001574256,0.0001141025,0.006515234,0.0001537766,0.00001380595,0.0000116523,0.00004356556,0.7997939,0.07419141,0.001066252,0.1159005,0.0006215454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4741259,0.00005059274,0.372568,0.0002373714,0.001971031,0.0002764409,0.000006009506,0.001393512,0.1493712],"genre_scores_gemma":[0.9973972,0.00001188494,0.0003331651,0.0001294197,0.00020667,0.0000215671,0.000004656465,0.00004169191,0.001853719],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5232713,"threshold_uncertainty_score":0.5789236,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01503853848912705,"score_gpt":0.2458957751951523,"score_spread":0.2308572367060252,"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."}}