{"id":"W658016334","doi":"10.1049/iet-com.2015.0026","title":"Joint channel coding‐cryptography based on random insertions and deletions in quasi‐cyclic‐low‐density parity check codes","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Low-density parity-check code; Cryptography; Computer science; Coding (social sciences); Channel code; Joint (building); Mathematics; Algorithm; Theoretical computer science; Decoding methods; Statistics; 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.0005177227,0.0001362359,0.0001848495,0.00008477853,0.0002644822,0.00003679637,0.0003316494,0.0001470363,0.000002388909],"category_scores_gemma":[0.000456119,0.0001218816,0.00008704445,0.0002178281,0.0002421238,0.000004833863,0.0002916385,0.0002258572,0.00000559544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001755521,"about_ca_system_score_gemma":0.00005355809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001430412,"about_ca_topic_score_gemma":0.0006563162,"domain_scores_codex":[0.9989034,0.0003137272,0.0002535674,0.0002484299,0.00008682258,0.0001940739],"domain_scores_gemma":[0.9987006,0.0001245859,0.00007913763,0.0008496846,0.0001192393,0.0001268022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.002365587,0.01555027,0.3188381,0.0001877025,0.0004743033,0.00001647006,0.003110079,0.005616623,0.5844674,0.03103826,0.02423253,0.0141026],"study_design_scores_gemma":[0.02573495,0.004530973,0.5672383,0.0007491337,0.0002409677,0.00005774647,0.003113933,0.2109934,0.08090267,0.02189011,0.0810665,0.003481306],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9836712,0.0004636683,0.008256655,0.00441047,0.00006062437,0.0003073371,0.00003697138,0.00004540712,0.002747677],"genre_scores_gemma":[0.9958793,0.0003255873,0.002357628,0.001027634,0.00003598053,0.00005402813,0.0002972844,0.000008510129,0.00001404832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5035647,"threshold_uncertainty_score":0.4970189,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05815915651934499,"score_gpt":0.2877791287491744,"score_spread":0.2296199722298294,"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."}}