{"id":"W2022582029","doi":"10.1109/tcomm.2005.861683","title":"A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Trellis (graph); Algorithm; Viterbi algorithm; Computer science; Soft output Viterbi algorithm; Space–time trellis code; Transmission (telecommunications); Channel (broadcasting); Binary number; Trellis modulation; Set (abstract data type); Viterbi decoder; Decoding methods; Mathematics; Fading; Sequential decoding; Error floor; Telecommunications; Block code","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002855594,0.000255928,0.0002849975,0.0003524936,0.0005600675,0.00009288709,0.002017966,0.0001317468,0.00001578925],"category_scores_gemma":[0.000006427201,0.0002502645,0.0001906455,0.0006923477,0.0002207151,0.0007233061,0.00001432019,0.0002779046,0.00000511384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008198385,"about_ca_system_score_gemma":0.0001328563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009734363,"about_ca_topic_score_gemma":0.00002507374,"domain_scores_codex":[0.9982142,0.0002275263,0.0005776508,0.0004357824,0.0002701783,0.0002746744],"domain_scores_gemma":[0.9962486,0.0005915846,0.0003169988,0.002358861,0.0003983458,0.00008561475],"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.00005641488,0.00232821,0.000002107925,0.00005995204,0.0000433175,8.720596e-7,0.0001811681,0.1104915,0.04946047,0.00254195,0.001381043,0.833453],"study_design_scores_gemma":[0.0007827565,0.0001909813,0.00005712834,0.0001517497,0.00003340894,0.000001982672,0.00001243877,0.6881703,0.3060302,0.001579288,0.002757401,0.0002324252],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006339262,0.0002035144,0.9961457,0.001381363,0.0001308639,0.001085179,0.0003354483,0.0005109843,0.0001435799],"genre_scores_gemma":[0.182246,0.0001253853,0.8161228,0.00007692092,0.00001721822,0.0009535607,0.0001205833,0.0000322864,0.0003051982],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8332206,"threshold_uncertainty_score":0.9999949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02849240647189072,"score_gpt":0.2981712143287754,"score_spread":0.2696788078568846,"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."}}