{"id":"W2154612888","doi":"10.1109/lcomm.2008.080713","title":"LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Ergodic theory; Channel (broadcasting); Binary symmetric channel; Channel code; Binary number; Algorithm; Computer science; List decoding; Mathematics; Low-density parity-check code; Sequential decoding; Linear programming; Joint (building); Coding (social sciences); Channel capacity; Telecommunications; Concatenated error correction code; Block code; Statistics; Arithmetic; Engineering; 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006201901,0.0001719399,0.0001927341,0.0001551463,0.001577524,0.0001129254,0.002339285,0.00005988157,3.179882e-7],"category_scores_gemma":[0.0001541565,0.000148821,0.0001245154,0.0002347244,0.0002925846,0.0002499635,0.0004879739,0.0002151293,0.000003109955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006317076,"about_ca_system_score_gemma":0.00004165507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001279503,"about_ca_topic_score_gemma":0.0000868649,"domain_scores_codex":[0.9988905,0.00007682826,0.0002829892,0.0002990986,0.0001269296,0.0003236785],"domain_scores_gemma":[0.9958772,0.001592034,0.0001686786,0.002185105,0.0001140719,0.0000629096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001234939,0.000879445,0.001725401,0.0003973312,0.0007275277,0.00001064806,0.1077833,0.006813915,0.2269059,0.0172896,0.4934525,0.1438908],"study_design_scores_gemma":[0.0005627463,0.00011362,0.000632246,0.0001028318,0.00003848422,0.000113666,0.0003038904,0.9718678,0.01524937,0.001711449,0.008859506,0.0004444199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0157267,0.0004518307,0.9493926,0.0328593,0.000283646,0.0008415279,0.000008203298,0.0003767641,0.00005941257],"genre_scores_gemma":[0.8033619,0.000304133,0.1917193,0.003743806,0.00007507131,0.0007010426,0.000004997671,0.00002558692,0.00006411074],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9650539,"threshold_uncertainty_score":0.9997223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09762366274818501,"score_gpt":0.3042148243508912,"score_spread":0.2065911616027062,"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."}}