{"id":"W4255746332","doi":"10.22215/etd/2016-11714","title":"Code Design for Incremental Redundancy Hybrid ARQ","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Hybrid automatic repeat request; Puncturing; Low-density parity-check code; Computer science; Turbo code; Forward error correction; Algorithm; Code rate; Error detection and correction; Automatic repeat request; Decoding methods; Computer network; Telecommunications; Telecommunications link","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.0009288631,0.0004600158,0.0003240668,0.0005589912,0.0003432872,0.0006176285,0.0009993174,0.0006129579,0.001144594],"category_scores_gemma":[0.003314901,0.0002391735,0.0002786947,0.0005090796,0.0006917702,0.000681906,0.0007403779,0.0006277263,0.0004820771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005087553,"about_ca_system_score_gemma":0.0007393535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007294287,"about_ca_topic_score_gemma":0.0007412269,"domain_scores_codex":[0.9991397,0.0002557173,0.00004155962,0.0001246929,0.0003755183,0.00006276861],"domain_scores_gemma":[0.997997,0.000865914,0.0002901235,0.0002637476,0.0005418808,0.00004119549],"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.0001832032,0.00005421403,0.001066339,0.0003196948,0.00005897384,0.0003234825,0.0003625376,0.4830872,0.05175671,0.2621392,0.002383604,0.1982647],"study_design_scores_gemma":[0.00002893053,0.0001316707,0.0001264059,0.00003555496,0.00001689441,0.0002548239,0.00003406587,0.9447388,0.01574032,0.03219861,0.006665002,0.00002882114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01244679,0.0002420546,0.9851934,0.0000844476,0.00002736388,0.00003828826,0.0000303094,0.0001815228,0.001755785],"genre_scores_gemma":[0.3684671,0.0004114808,0.6283007,0.0002072371,0.00005641619,0.0001923531,0.0001349006,0.00009662285,0.002133142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001144594,"threshold_uncertainty_score":0.004912376,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03601431453519498,"score_gpt":0.3123210348762377,"score_spread":0.2763067203410427,"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."}}