{"id":"W2097993003","doi":"10.1109/glocom.2005.1577881","title":"Detection of code index in turbo source coding","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Systematic code; Turbo code; Constant-weight code; Distributed source coding; Decoding methods; Variable-length code; Algorithm; Source code; Polynomial code; Low-density parity-check code; Code rate; Code (set theory); Coding (social sciences); Concatenated error correction code; Block code; Mathematics; Statistics; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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.0003628518,0.0003793995,0.0005101258,0.0003369232,0.0001862883,0.00006419927,0.001813616,0.0003008569,0.0000913007],"category_scores_gemma":[0.00007229724,0.0004644668,0.0001249408,0.0009545638,0.0002341332,0.0006434207,0.0002502449,0.0006939514,0.00006825644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008357076,"about_ca_system_score_gemma":0.0001077029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002997614,"about_ca_topic_score_gemma":0.00783919,"domain_scores_codex":[0.9976044,0.0001975592,0.001037991,0.0003089785,0.0002725279,0.0005785266],"domain_scores_gemma":[0.9970291,0.0001685134,0.0002650681,0.002164479,0.0002240247,0.0001488178],"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.00006555817,0.0007030622,0.005201418,0.0001372222,0.0001696974,0.000002344085,0.0006777824,0.189644,0.02610918,0.01186057,0.004210442,0.7612187],"study_design_scores_gemma":[0.002170415,0.0001097868,0.01362547,0.0004890338,0.00006253455,0.00008921392,0.0006430228,0.6688197,0.09549307,0.005275887,0.2115328,0.001689037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1964328,0.002843628,0.7458261,0.001327587,0.0003903565,0.001312005,0.0002660379,0.00277242,0.04882909],"genre_scores_gemma":[0.9729035,0.003204627,0.0233809,0.00009070915,0.00004238121,0.000166282,0.00005332004,0.00004545115,0.0001127991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7764708,"threshold_uncertainty_score":0.9997807,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01945516942028984,"score_gpt":0.2698235767624036,"score_spread":0.2503684073421137,"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."}}