{"id":"W2799779867","doi":"10.1109/isit.2018.8437918","title":"Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Division of Electrical, Communications and Cyber Systems; National Science Foundation","keywords":"Independent and identically distributed random variables; Energy (signal processing); Transmitter power output; Mathematics; Dirty paper coding; Additive white Gaussian noise; Block (permutation group theory); Channel (broadcasting); Gaussian process; Gaussian; Markov process; Discrete mathematics; Combinatorics; Statistics; Transmitter; Random variable; Computer science; Telecommunications; White noise; Physics; Precoding; MIMO","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.006796454,0.002340151,0.001931047,0.001984134,0.001389985,0.002750876,0.002310498,0.001619357,0.00245178],"category_scores_gemma":[0.03205727,0.0006600724,0.001315083,0.002220665,0.004328669,0.0042001,0.003705414,0.002850509,0.0009477798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002987282,"about_ca_system_score_gemma":0.002159813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002274188,"about_ca_topic_score_gemma":0.002019282,"domain_scores_codex":[0.9948881,0.001630519,0.0002619151,0.0005200643,0.001653637,0.001045848],"domain_scores_gemma":[0.9690851,0.02308042,0.002471418,0.002021582,0.002903063,0.0004383582],"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.0004902191,0.0001708754,0.00110528,0.0005570937,0.0001256083,0.0005425778,0.0006707751,0.5347394,0.01036578,0.3973115,0.003339408,0.05058138],"study_design_scores_gemma":[0.0000250076,0.0001018206,0.0002893411,0.0001017222,0.00004718217,0.0004744042,0.0001521001,0.8825483,0.006931284,0.1078816,0.001375428,0.0000717768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04547742,0.002416432,0.9344495,0.0007241115,0.000120932,0.00009579201,0.0002095277,0.0005369441,0.01596933],"genre_scores_gemma":[0.9251668,0.002701362,0.06682523,0.0002953973,0.000180527,0.0002820465,0.0002421757,0.000211092,0.004095292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006796454,"threshold_uncertainty_score":0.03594351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02424268090729838,"score_gpt":0.2804427690806926,"score_spread":0.2562000881733942,"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."}}