{"id":"W2505549722","doi":"10.1109/icc.2016.7511551","title":"An efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes","year":2016,"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":"Low-density parity-check code; Tanner graph; Algorithm; Computer science; Search algorithm; Variable (mathematics); Simple (philosophy); Graph; Code (set theory); Decoding methods; Theoretical computer science; Mathematics; Error floor; Set (abstract data type)","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.0002936498,0.0004632465,0.0005336214,0.0009491824,0.0005019077,0.0004331275,0.0007906205,0.0005549973,0.003119328],"category_scores_gemma":[0.001637717,0.0002854077,0.0004262609,0.0007106094,0.0003709104,0.0009513376,0.0008654255,0.0005054845,0.0006141482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004755697,"about_ca_system_score_gemma":0.00122993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001991384,"about_ca_topic_score_gemma":0.003597479,"domain_scores_codex":[0.9997352,0.00005469565,0.00002113582,0.0000504634,0.00009896466,0.00003967246],"domain_scores_gemma":[0.9995054,0.0002803069,0.00004008865,0.00006122428,0.00009323398,0.00001987146],"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.0003336852,0.0001585621,0.002256793,0.0004200469,0.0001073353,0.000309129,0.0003424797,0.3637797,0.03163823,0.04837716,0.004476383,0.5478004],"study_design_scores_gemma":[0.00004497364,0.0000653992,0.0003135556,0.00001808238,0.00001795924,0.0001563355,0.00003651066,0.9768208,0.007533744,0.01234375,0.002632251,0.00001665188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03480227,0.0002204881,0.960869,0.0000802424,0.00001863665,0.0001272184,0.0000977403,0.0007681388,0.003016348],"genre_scores_gemma":[0.2575344,0.0002317678,0.7375445,0.00009383806,0.00001478821,0.0002985465,0.000595423,0.0001297304,0.003557051],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003119328,"threshold_uncertainty_score":0.01043516,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02255639370847612,"score_gpt":0.3030182334455154,"score_spread":0.2804618397370393,"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."}}