{"id":"W3164808597","doi":"10.1109/tcomm.2023.3256415","title":"Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Intersymbol interference; Computer science; Markov chain; Markov process; Nyquist ISI criterion; Mathematical optimization; Secrecy; Iterative method; Interference (communication); Algorithm; Mathematics; Decoding methods; Computer network; Channel (broadcasting); Statistics; Computer security","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002788753,0.0002199326,0.0002993725,0.0005243921,0.0002236488,0.00003700526,0.001611304,0.0001501645,0.0001101598],"category_scores_gemma":[0.00002633402,0.0002592002,0.000156763,0.001017098,0.0004295702,0.0002133545,0.00002136636,0.0006917237,0.0001498988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008995311,"about_ca_system_score_gemma":0.00003618975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007605462,"about_ca_topic_score_gemma":0.0001963299,"domain_scores_codex":[0.9987039,0.000173586,0.0005355104,0.0001710314,0.0001702358,0.0002457367],"domain_scores_gemma":[0.9961617,0.0008533294,0.0000840361,0.00264179,0.0001670191,0.0000921051],"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.0001606595,0.003153454,0.0001894288,0.001246157,0.002229267,0.000008238795,0.07091508,0.3676917,0.2871275,0.04831756,0.006749381,0.2122116],"study_design_scores_gemma":[0.0006606717,0.0001823461,0.0001668913,0.0006210501,0.00008705279,0.0000128978,0.001342549,0.6881235,0.300764,0.004508181,0.002788123,0.000742685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04875302,0.0001051586,0.9385868,0.001154197,0.000451107,0.000558685,0.0003518276,0.003282113,0.006757048],"genre_scores_gemma":[0.9937391,0.001612111,0.004096141,0.00004284696,0.000009195328,0.0002969584,0.00004285675,0.00004845902,0.0001122762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9449862,"threshold_uncertainty_score":0.999986,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06085588529188848,"score_gpt":0.2809806846230444,"score_spread":0.2201247993311559,"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."}}