{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165397,0.000642748,0.0006646854,0.0006604685,0.0004766349,0.001529434,0.0006900593,0.001169334,0.001209598],"category_scores_gemma":[0.007454301,0.0002631395,0.0003445946,0.001164777,0.001956241,0.002094378,0.001264078,0.001931963,0.0003894236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008915433,"about_ca_system_score_gemma":0.001139839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009227234,"about_ca_topic_score_gemma":0.0007211795,"domain_scores_codex":[0.9987137,0.0005911088,0.00005109401,0.0001468819,0.0004064763,0.00009076495],"domain_scores_gemma":[0.9948319,0.00391385,0.0003778421,0.0003853381,0.0004252595,0.00006578372],"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.0001470039,0.00003872634,0.0004578206,0.0001669198,0.0000244506,0.0001973396,0.000153486,0.4647299,0.003797572,0.4887316,0.001270549,0.04028478],"study_design_scores_gemma":[0.000006405915,0.00002365146,0.00005813125,0.00001102005,0.000004414392,0.00005546308,0.00001381541,0.9099292,0.002187203,0.08695854,0.0007404263,0.00001175065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0284126,0.0007945879,0.9638289,0.0005239337,0.00005540163,0.00002736448,0.00009927298,0.0001126568,0.006145264],"genre_scores_gemma":[0.739614,0.001909521,0.2504757,0.0002238902,0.0002101477,0.000208656,0.0002314577,0.0001089101,0.007017759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00165397,"threshold_uncertainty_score":0.008747101,"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."}}