{"id":"W2514571107","doi":"10.1109/isit.2016.7541754","title":"Minimal characterization and provably 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":"Characterization (materials science); Algorithm; Low-density parity-check code; Computer science; Code (set theory); Mathematics; Discrete mathematics; Decoding methods","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.0003136849,0.0005486698,0.0006570118,0.0008788129,0.000667345,0.0008687377,0.0009767825,0.0005958286,0.00281432],"category_scores_gemma":[0.002827902,0.0003637381,0.0006654559,0.000619588,0.0006484122,0.001844635,0.001476025,0.001105372,0.0004264704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008453251,"about_ca_system_score_gemma":0.001448575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001500328,"about_ca_topic_score_gemma":0.002270077,"domain_scores_codex":[0.9993873,0.000112259,0.00004835011,0.0001394997,0.0002202014,0.00009243595],"domain_scores_gemma":[0.9987575,0.0007085729,0.0001144703,0.0001743614,0.0001879585,0.00005712999],"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.0006378519,0.0003334079,0.005385467,0.0006966059,0.0001203538,0.0004150704,0.0008536545,0.3423586,0.06225933,0.2168794,0.007244442,0.362816],"study_design_scores_gemma":[0.00006051723,0.000107482,0.0005971492,0.00003365699,0.00002848856,0.0002454927,0.0001236793,0.8908184,0.01620506,0.08792747,0.003821374,0.00003121161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1092919,0.0001846503,0.8833501,0.0002586378,0.00001920681,0.0002064769,0.0003330026,0.0007404639,0.005615613],"genre_scores_gemma":[0.5304037,0.0001819499,0.4627474,0.0001566902,0.00002425608,0.0003642702,0.001717716,0.0001900838,0.004214018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00281432,"threshold_uncertainty_score":0.009414852,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01737341084421058,"score_gpt":0.2660837653291956,"score_spread":0.2487103544849851,"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."}}