{"id":"W2144085454","doi":"10.1109/dcc.1993.253138","title":"Minimizing error and VLSI complexity in the multiplication free approximation of arithmetic coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arithmetic; Alphabet; Binary number; Arithmetic coding; Multiplication (music); Multiplication algorithm; Coding (social sciences); Computer science; Algorithm; Very-large-scale integration; Arbitrary-precision arithmetic; Saturation arithmetic; Reduction (mathematics); Mathematics; Context-adaptive binary arithmetic coding; Data compression; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0002668203,0.00005502277,0.00008038271,0.0000579767,0.00006907484,0.00005803607,0.0004907045,0.00002377379,0.000008812056],"category_scores_gemma":[0.00004811491,0.00003676219,0.00001298322,0.0001986356,0.00004401066,0.0003575759,0.0002050019,0.00005945744,0.000002386108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008013565,"about_ca_system_score_gemma":0.000002444468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000855182,"about_ca_topic_score_gemma":0.00002187372,"domain_scores_codex":[0.9993666,0.00005586295,0.0001678959,0.0001674528,0.000154334,0.00008782187],"domain_scores_gemma":[0.9993272,0.0001222368,0.00007022969,0.0004370676,0.00002583605,0.00001744249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009094154,0.000687308,0.005109579,0.0001635326,0.00001288371,0.000005116719,0.0162397,0.0002110321,0.008156064,0.5009801,0.003909511,0.464516],"study_design_scores_gemma":[0.0002641511,0.00001670616,0.02014788,0.00001848547,0.000001347105,0.000005571856,0.0001331889,0.9742112,0.0005035224,0.004519811,0.0001266438,0.00005149935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04306059,0.0001014418,0.9532863,0.001405983,0.0000347184,0.0001967983,0.000003046342,0.00003343039,0.001877691],"genre_scores_gemma":[0.746635,0.00001151815,0.2532352,0.00008519632,0.000009269211,0.000007572701,0.000002440642,0.000001500883,0.00001230958],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9740002,"threshold_uncertainty_score":0.1499119,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1081076579670121,"score_gpt":0.2796426647168135,"score_spread":0.1715350067498013,"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."}}