{"id":"W2134430085","doi":"10.1109/isit.2012.6284047","title":"Jar decoding: LDPC coding theorems for binary input memoryless channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Decoding methods; Code word; List decoding; Algorithm; Sequential decoding; Binary symmetric channel; Binary number; Parity-check matrix; Computer science; Coding (social sciences); Channel (broadcasting); Mathematics; Discrete mathematics; Theoretical computer science; Concatenated error correction code; Block code; Arithmetic; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323765,0.0002021066,0.000217022,0.0001922333,0.0002313876,0.0001464353,0.001130624,0.0001022955,0.00002296693],"category_scores_gemma":[0.0001704865,0.0001779679,0.0001131866,0.0003405134,0.00004132771,0.0009583458,0.0004690029,0.0001445902,0.00004320155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007611583,"about_ca_system_score_gemma":0.00003332697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000210992,"about_ca_topic_score_gemma":0.000003658583,"domain_scores_codex":[0.9984441,0.00006521151,0.0002540932,0.0003715993,0.0002153976,0.0006496248],"domain_scores_gemma":[0.9985566,0.0004033528,0.0001141341,0.000656779,0.0001056318,0.0001634923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000190545,0.0002509931,0.003122872,0.00007992166,0.0000371834,0.000005604766,0.005710941,0.0000331702,0.02085728,0.8936468,0.02008545,0.05615069],"study_design_scores_gemma":[0.000851405,0.0005241218,0.0006700063,0.000196219,0.0000328996,0.000143804,0.0005717148,0.2550444,0.6723856,0.04977116,0.01825866,0.001550031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03694534,0.000114616,0.947013,0.0006844632,0.002141071,0.0004555461,0.000001014955,0.001695095,0.01094986],"genre_scores_gemma":[0.8334258,0.000007560299,0.1648535,0.0005354151,0.0002884741,0.0000889064,0.00000142507,0.00002376455,0.0007751575],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8438757,"threshold_uncertainty_score":0.725732,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04648735793917882,"score_gpt":0.3056263787452568,"score_spread":0.259139020806078,"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."}}