{"id":"W2066943407","doi":"10.1109/icc.2004.1312528","title":"Reliability-based schedule for decoding low-density parity-check codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Computer science; Schedule; Low-density parity-check code; Flooding (psychology); Tanner graph; Binary number; Reliability (semiconductor); Sequential decoding; List decoding; Algorithm; Parallel computing; Theoretical computer science; Concatenated error correction code; Arithmetic; Mathematics; Block code","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.00075479,0.0005748073,0.0004095669,0.0007062501,0.0004823159,0.0003701804,0.0008540469,0.0004072131,0.001349031],"category_scores_gemma":[0.003988869,0.0002436894,0.0002977903,0.0005439446,0.0004907201,0.0005098933,0.0005012457,0.0006883398,0.0006028492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007150894,"about_ca_system_score_gemma":0.001235795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001860633,"about_ca_topic_score_gemma":0.001898742,"domain_scores_codex":[0.9994936,0.0001627295,0.00003249352,0.00005502445,0.0002016202,0.00005451613],"domain_scores_gemma":[0.9982681,0.0007174709,0.0002024708,0.0002589389,0.0004790927,0.00007386912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005109748,0.00008342329,0.0009095977,0.0002716875,0.00004864882,0.0002878239,0.0002659805,0.6298515,0.0503098,0.1168091,0.004960699,0.1956908],"study_design_scores_gemma":[0.00006203294,0.0002503659,0.0002299493,0.00001581369,0.00002661693,0.0001364574,0.00001702129,0.9534075,0.01421885,0.02699058,0.004612661,0.00003215957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02402288,0.0001790911,0.9725351,0.0001281253,0.00005754083,0.0001165736,0.0001080346,0.0008780052,0.001974649],"genre_scores_gemma":[0.5803293,0.0003938671,0.4143006,0.00008993244,0.00009102422,0.0004284414,0.0004672052,0.0001639261,0.003735693],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001860633,"threshold_uncertainty_score":0.005188406,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02103729412018669,"score_gpt":0.283878375669828,"score_spread":0.2628410815496414,"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."}}