{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001584095,0.0008008895,0.0009099413,0.0009302877,0.0006285539,0.001012044,0.001455041,0.001084569,0.002598601],"category_scores_gemma":[0.003839548,0.0005149493,0.0006466068,0.0008383787,0.0008180867,0.001354338,0.0008294387,0.001465148,0.001491739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009157006,"about_ca_system_score_gemma":0.00137228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001980224,"about_ca_topic_score_gemma":0.002292868,"domain_scores_codex":[0.9988494,0.0002727107,0.00008587508,0.0001786446,0.0005113491,0.0001020381],"domain_scores_gemma":[0.9982237,0.0006948871,0.000218779,0.0002803659,0.0005375271,0.00004469401],"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.0006701653,0.000101701,0.0004155227,0.0002464263,0.000124931,0.0002198221,0.0002843713,0.2569862,0.1303723,0.05276762,0.006417055,0.5513937],"study_design_scores_gemma":[0.0000945733,0.000209748,0.0002522364,0.00003090772,0.00003818455,0.0003702052,0.000021764,0.9177924,0.06519055,0.008643806,0.007261477,0.00009415942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003854677,0.0002675287,0.994602,0.00008184743,0.00004076026,0.00004687505,0.00003503876,0.000490722,0.0005805722],"genre_scores_gemma":[0.09484673,0.0003416338,0.9009047,0.0001145018,0.00008319982,0.0002204182,0.0002286151,0.0001575889,0.00310259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002598601,"threshold_uncertainty_score":0.008693218,"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."}}