{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009265122,0.0002408501,0.0002742586,0.0002576358,0.0005346045,0.0002327339,0.004368232,0.00009289505,5.684821e-7],"category_scores_gemma":[0.0003041197,0.0002662252,0.0001357255,0.0004448973,0.0001695117,0.0007068002,0.0008135239,0.0003489545,0.0000267556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002059635,"about_ca_system_score_gemma":0.00009686705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001552169,"about_ca_topic_score_gemma":0.00006827076,"domain_scores_codex":[0.9982817,0.0001952725,0.0004194925,0.0004255443,0.0002442943,0.0004337381],"domain_scores_gemma":[0.994777,0.001401822,0.0002259594,0.003182716,0.0002596687,0.0001528799],"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.0000436156,0.001028507,0.01035439,0.0001342352,0.0003835162,0.00003477201,0.02503014,0.005850239,0.1698362,0.005947761,0.1950257,0.5863309],"study_design_scores_gemma":[0.0005591133,0.00007337373,0.0002463941,0.0001217563,0.00001751184,0.00002453069,0.0002321359,0.9878349,0.004680821,0.0007348615,0.005045193,0.0004294363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01285585,0.0002186381,0.9732519,0.01119349,0.0005572033,0.0005984727,0.00000845723,0.001021731,0.0002942019],"genre_scores_gemma":[0.3436943,0.00003624365,0.6542535,0.001583281,0.00006449776,0.0002964873,0.00001620708,0.00002508964,0.0000303759],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9819846,"threshold_uncertainty_score":0.999979,"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."}}