{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002763936,0.001043785,0.0008736079,0.001703468,0.0007924968,0.001925602,0.001034288,0.001477405,0.001353185],"category_scores_gemma":[0.01178158,0.000464627,0.0006147238,0.001658581,0.00198602,0.002764723,0.001441523,0.002982768,0.0009182781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001358137,"about_ca_system_score_gemma":0.001375099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00176918,"about_ca_topic_score_gemma":0.001127217,"domain_scores_codex":[0.9979922,0.0007030964,0.000111163,0.0002528347,0.0007985713,0.0001422602],"domain_scores_gemma":[0.9955973,0.00243515,0.0003900871,0.0005389047,0.0009355303,0.0001029666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001653383,0.00003793549,0.0004242356,0.0002386303,0.00002664123,0.0002606297,0.0002445391,0.1026795,0.006677519,0.8252153,0.004295048,0.05973464],"study_design_scores_gemma":[0.00002698928,0.00005225537,0.0001469644,0.0000513905,0.00001215226,0.0002086771,0.0000212036,0.6088845,0.008440271,0.37463,0.00748352,0.00004203348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004545735,0.0006436159,0.9900897,0.000264851,0.00007786427,0.00003568951,0.000139408,0.0002197328,0.003983464],"genre_scores_gemma":[0.3114321,0.003829594,0.6718334,0.001001843,0.0005432394,0.0004908003,0.0008490651,0.0003816055,0.009638323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002763936,"threshold_uncertainty_score":0.01461732,"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."}}