{"id":"W2006142981","doi":"10.1109/lcomm.2013.111113.131881","title":"Lowering the Error Floor of LDPC Codes Using Multi-Step Quantization","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Error floor; Quantization (signal processing); Computer science; Forward error correction; Error detection and correction; Decoding methods; Algorithm; Turbo code; Theoretical computer science","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.0003585154,0.0004690463,0.0004685554,0.0004758858,0.0004281701,0.0005579069,0.0007669627,0.0005183914,0.001412092],"category_scores_gemma":[0.001772935,0.0001780861,0.0001979168,0.0004837036,0.0006206281,0.0006914882,0.0009758361,0.000955788,0.0003828696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003786659,"about_ca_system_score_gemma":0.0006181414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005690787,"about_ca_topic_score_gemma":0.0009427547,"domain_scores_codex":[0.9995333,0.00009266501,0.0000302449,0.00005574988,0.0002421611,0.00004592381],"domain_scores_gemma":[0.9991165,0.0003438657,0.00009496846,0.0001946999,0.0002126133,0.0000374365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004048824,0.0001285665,0.00134197,0.0004103981,0.00003863823,0.0003423725,0.0002499358,0.1143503,0.398999,0.1162846,0.002733321,0.3647161],"study_design_scores_gemma":[0.00003943747,0.0002327151,0.0004745919,0.00004906204,0.00001920797,0.0003067885,0.0000256027,0.7544463,0.223158,0.0160164,0.005179625,0.00005234166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.036414,0.0005482791,0.9586177,0.000182684,0.0000896312,0.00006515631,0.00006283513,0.0009672244,0.003052355],"genre_scores_gemma":[0.5710118,0.0004282437,0.4248674,0.0001349271,0.00004528742,0.00008552989,0.00009955023,0.00006692147,0.003260259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001412092,"threshold_uncertainty_score":0.004723907,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08758308685031735,"score_gpt":0.3365748962485317,"score_spread":0.2489918093982144,"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."}}