{"id":"W2106257703","doi":"10.1109/icc.1989.49752","title":"Reduced-complexity trellis coding/decoding for high bit rate digital subscriber loop transmission","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Computer science; Estimator; Bit error rate; Channel (broadcasting); Algorithm; Coding (social sciences); Transmission (telecommunications); Theoretical computer science; Trellis (graph); Digital subscriber line; Computer network; Mathematics; Telecommunications; Statistics","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.0003774189,0.0002850466,0.0002440568,0.0003658724,0.0001831985,0.0004288749,0.0004624935,0.0005021447,0.003222812],"category_scores_gemma":[0.002316997,0.0001564107,0.0002688876,0.0004649728,0.0002737872,0.0005060961,0.0002866939,0.000521822,0.001012376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005291571,"about_ca_system_score_gemma":0.0006313628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00295564,"about_ca_topic_score_gemma":0.003879109,"domain_scores_codex":[0.9995365,0.0001572794,0.00001577032,0.00002486562,0.0002373576,0.00002826733],"domain_scores_gemma":[0.9994798,0.0002447989,0.00003978856,0.0001214128,0.0001041518,0.0000100248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003220242,0.0000733856,0.0005724801,0.000239657,0.00005826299,0.0002151293,0.000160186,0.5193264,0.07139984,0.07728551,0.00491886,0.3254282],"study_design_scores_gemma":[0.00001321717,0.00005892603,0.000154619,0.00001186745,0.00001201588,0.0000822771,0.000006971897,0.9753027,0.01444244,0.007045546,0.00285877,0.00001065525],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02174872,0.0002964051,0.9741965,0.0001662652,0.00004874037,0.000036219,0.00008375446,0.001006054,0.002417426],"genre_scores_gemma":[0.4798802,0.0006431368,0.5101622,0.0001417509,0.00009883499,0.0001142445,0.0003180871,0.0001719162,0.008469727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003222812,"threshold_uncertainty_score":0.01078141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0374876544472192,"score_gpt":0.2637125200451399,"score_spread":0.2262248655979207,"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."}}