{"id":"W2136428131","doi":"10.1109/glocom.1999.831721","title":"A capacity-approaching hybrid ARQ scheme using turbo codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Turbo code; Computer science; Hybrid automatic repeat request; Turbo; Scheme (mathematics); Selective Repeat ARQ; Automatic repeat request; Serial concatenated convolutional codes; Concatenated error correction code; Computer network; Decoding methods; Algorithm; Engineering; Block code; Mathematics; 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.001698635,0.0008266171,0.0009936562,0.0006752625,0.001049891,0.001073824,0.001269065,0.0009910469,0.001717596],"category_scores_gemma":[0.002742517,0.0003251942,0.0005867553,0.0006988255,0.00133763,0.001550138,0.001713139,0.0009267596,0.0008413967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004329725,"about_ca_system_score_gemma":0.0006250943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007237745,"about_ca_topic_score_gemma":0.0006932961,"domain_scores_codex":[0.9989299,0.0003266381,0.0000621311,0.0001148428,0.0004074671,0.0001588943],"domain_scores_gemma":[0.9977042,0.0007582651,0.000181174,0.0005979588,0.0006291964,0.0001293203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001469047,0.0002643191,0.001923432,0.0003520826,0.0002491253,0.001652722,0.000913841,0.270174,0.2509155,0.1809152,0.004460121,0.2867107],"study_design_scores_gemma":[0.0001413182,0.0006475844,0.0004375416,0.00003840832,0.00008781169,0.00110475,0.00006174554,0.9178748,0.04583603,0.02878995,0.004822578,0.0001575252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08544631,0.0006237332,0.9050284,0.0002505965,0.0001421028,0.000124973,0.00008165021,0.00157357,0.006728624],"genre_scores_gemma":[0.8252367,0.0002843198,0.1711495,0.0001253219,0.0001199373,0.0001115525,0.00007585857,0.00005165154,0.002845237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001717596,"threshold_uncertainty_score":0.008983314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03856533357323117,"score_gpt":0.2505671642373538,"score_spread":0.2120018306641226,"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."}}