{"id":"W2558776151","doi":"10.1109/isit.2017.8006717","title":"Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Characterization (materials science); Low-density parity-check code; Computer science; Terminology; Simple (philosophy); Algorithm; Code (set theory); Ranging; Representation (politics); Theoretical computer science; Decoding methods; Programming language","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.0003584936,0.0005544553,0.0006526464,0.001269878,0.0004341634,0.0006766907,0.0008775234,0.0005480022,0.002247323],"category_scores_gemma":[0.003034934,0.0002924803,0.0004977189,0.0009114858,0.0005424077,0.001168363,0.0009932072,0.0005981988,0.0004015427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006605633,"about_ca_system_score_gemma":0.001408228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002055345,"about_ca_topic_score_gemma":0.002672936,"domain_scores_codex":[0.9996567,0.00008645227,0.00002626556,0.00007189099,0.0001011584,0.00005763875],"domain_scores_gemma":[0.998744,0.0007922659,0.0001288892,0.0001429365,0.000147137,0.00004476671],"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.0003980969,0.0001627674,0.005384998,0.0004997478,0.00008453253,0.0002500411,0.0005018446,0.6104535,0.0228682,0.1058358,0.003984325,0.2495761],"study_design_scores_gemma":[0.00002763338,0.00004954698,0.0003881841,0.00001621691,0.0000125296,0.0001162848,0.00005336939,0.9688219,0.003245187,0.02601236,0.001245472,0.00001120182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1026569,0.0002536896,0.8914225,0.0001711967,0.000014038,0.0001879425,0.0003575535,0.000586118,0.004350057],"genre_scores_gemma":[0.4336784,0.0002444117,0.560965,0.0001005367,0.00001673345,0.0003831595,0.001637861,0.0001404301,0.002833486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002247323,"threshold_uncertainty_score":0.007518053,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03076213999121107,"score_gpt":0.3109040462150831,"score_spread":0.280141906223872,"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."}}