{"id":"W2019405212","doi":"10.1109/twc.2013.011713.120914","title":"Multi-Layer Iterative LDPC Decoding for Broadband Wireless Access Networks: A Recursive Shortening Algorithm","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Decoding methods; Algorithm; Low-density parity-check code; Wireless; Wireless broadband; Theoretical computer science; Wireless network; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000388581,0.000412213,0.0004291797,0.0004239351,0.001337657,0.0008142543,0.004276788,0.000226274,0.00001661507],"category_scores_gemma":[0.00001660267,0.0004371164,0.0002638007,0.001035032,0.0002069229,0.002123706,0.00007766806,0.0008466078,0.00002656328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002476592,"about_ca_system_score_gemma":0.0001116832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003705401,"about_ca_topic_score_gemma":0.0004360486,"domain_scores_codex":[0.9974338,0.0003383237,0.000640378,0.0007118777,0.0002722026,0.0006034123],"domain_scores_gemma":[0.9944812,0.00144085,0.0003052098,0.002846322,0.0007241056,0.0002022844],"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.00001360727,0.0007550936,0.00006542419,0.00002161542,0.0001813336,0.000001927035,0.003119179,0.007270466,0.003011297,0.001516484,0.0008349925,0.9832086],"study_design_scores_gemma":[0.0005104669,0.0001184702,0.0001029658,0.0002275196,0.00004254479,0.00001908175,0.0002121643,0.9856708,0.0118846,0.000518378,0.0001902295,0.0005027549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004313175,0.0001420853,0.9908561,0.001031035,0.000644198,0.001703475,0.00003140629,0.001089178,0.0001893622],"genre_scores_gemma":[0.5606783,0.0002669198,0.4364763,0.0002706556,0.00003017269,0.002023245,0.00001123784,0.0000449804,0.0001982387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9827058,"threshold_uncertainty_score":0.9999624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.065181307738267,"score_gpt":0.336237043108389,"score_spread":0.271055735370122,"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."}}