{"id":"W2074931698","doi":"10.1109/tcomm.2012.082812.110817","title":"LDGM-Based Multiple Description Coding for Finite Alphabet Sources","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Binary number; Mathematics; Algorithm; Coding (social sciences); Rate–distortion theory; Distortion (music); Upper and lower bounds; Rate distortion; Computer science; Statistics; Arithmetic; Bandwidth (computing); Telecommunications; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0003235563,0.0001451862,0.0001325906,0.0001722366,0.001081244,0.0001454944,0.001384935,0.00007666698,0.00001644536],"category_scores_gemma":[0.00002168883,0.0001425284,0.0001220661,0.0003061554,0.00007561495,0.0009957822,0.00001558388,0.0002237684,0.00005548811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006134636,"about_ca_system_score_gemma":0.00004506253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000539368,"about_ca_topic_score_gemma":0.00004970441,"domain_scores_codex":[0.9989516,0.0001206115,0.0002500632,0.0002050618,0.0001680309,0.0003046553],"domain_scores_gemma":[0.9965918,0.001124489,0.00009709288,0.001951291,0.0001024337,0.0001328797],"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.0002522726,0.0113064,0.002139011,0.0002022679,0.0003872839,0.000001241204,0.009546021,0.1380767,0.03411441,0.04811484,0.01445454,0.7414051],"study_design_scores_gemma":[0.0006768347,0.00007477072,0.0003290823,0.00005357758,0.00002631864,0.000002098657,0.00006423671,0.9301357,0.01213304,0.0002905987,0.05598131,0.0002324174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000637801,0.0002190612,0.9962164,0.001445056,0.0005496214,0.0003391191,0.0001169447,0.0002715307,0.000204427],"genre_scores_gemma":[0.7645993,0.00006303077,0.2345683,0.0003192017,0.0000304819,0.0002525594,0.00003585124,0.00001289578,0.0001184177],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7920591,"threshold_uncertainty_score":0.8316166,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08652453606989656,"score_gpt":0.2955598895495641,"score_spread":0.2090353534796675,"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."}}