{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000990681,0.0004285216,0.0005008887,0.0005731471,0.0006566469,0.0007099292,0.000800349,0.0007709184,0.0009909581],"category_scores_gemma":[0.002359336,0.0002724542,0.0003865797,0.0006184835,0.001599894,0.001438072,0.001154505,0.001032535,0.0004397054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005743995,"about_ca_system_score_gemma":0.001162783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004646234,"about_ca_topic_score_gemma":0.0005128938,"domain_scores_codex":[0.9987028,0.0003485565,0.0000514087,0.0001503586,0.0005929242,0.000153975],"domain_scores_gemma":[0.9977276,0.000955331,0.0003187714,0.0006433324,0.0002813923,0.00007360584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008535291,0.0001490463,0.00143819,0.0004523709,0.0000947829,0.0007537502,0.0003966507,0.1676987,0.2396493,0.4843887,0.001882483,0.1022425],"study_design_scores_gemma":[0.0001393312,0.000448381,0.0006559438,0.00006103651,0.00007847961,0.001150405,0.00004922242,0.7394773,0.1973496,0.05083347,0.009624442,0.000132466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09830366,0.0006611513,0.8942379,0.0004329275,0.0001510506,0.0001559288,0.00009792474,0.0003989692,0.005560394],"genre_scores_gemma":[0.8635657,0.000545759,0.1326136,0.0001034671,0.00006601156,0.0001559167,0.00008696541,0.00004202049,0.002820716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009909581,"threshold_uncertainty_score":0.005239248,"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."}}