{"id":"W2019352729","doi":"10.1109/lcomm.2015.2418260","title":"Multiple-Votes Parallel Symbol-Flipping Decoding Algorithm for Non-Binary LDPC Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Université Européenne de Bretagne; Research and Development Corporation of Newfoundland and Labrador; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Computer science; Binary number; Parity-check matrix; Code (set theory); Berlekamp–Welch algorithm; Sequential decoding; Error detection and correction; Mathematics; Block code; Arithmetic; Error floor","routes":{"ca_aff":true,"ca_fund":true,"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.0004549521,0.0005251486,0.0006508292,0.0005807824,0.0005474808,0.0005691208,0.001070479,0.0006519399,0.001766688],"category_scores_gemma":[0.001557202,0.0002854953,0.0003147541,0.0007189045,0.000459969,0.0007011497,0.0006617561,0.0008013456,0.0006838597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005504296,"about_ca_system_score_gemma":0.001568395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001605127,"about_ca_topic_score_gemma":0.002665867,"domain_scores_codex":[0.9994658,0.00011139,0.00003739698,0.00008235347,0.0002680311,0.00003504662],"domain_scores_gemma":[0.999339,0.0002066167,0.00006298407,0.000131478,0.0002375519,0.00002228955],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003214945,0.00007290072,0.001020133,0.000226436,0.00006167362,0.0001982785,0.0001395455,0.1703819,0.06969008,0.0565361,0.00335081,0.6980007],"study_design_scores_gemma":[0.0000634102,0.0000775988,0.0003517693,0.00001690923,0.00001916111,0.0002786762,0.00001330656,0.9333472,0.04737129,0.01190529,0.006527408,0.00002792068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009907058,0.0001177536,0.9879321,0.00008110332,0.00004308939,0.00006026726,0.00005777915,0.000351354,0.001449325],"genre_scores_gemma":[0.1355838,0.0002139044,0.8586009,0.00008019633,0.0000380944,0.0002002592,0.000244503,0.00008026711,0.004958029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001766688,"threshold_uncertainty_score":0.005910158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07857282465175856,"score_gpt":0.3242857446273224,"score_spread":0.2457129199755638,"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."}}