{"id":"W2116381650","doi":"10.1109/issse.2007.4294441","title":"Powerful LDPC Codes for Broadband Wireless Networks: High-performance Code Construction and High-speed Encoder/Decoder Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Low-density parity-check code; Computer science; Encoder; Decoding methods; Forward error correction; Throughput; Parity-check matrix; Concatenated error correction code; Code (set theory); Field-programmable gate array; Error detection and correction; Block code; Algorithm; Wireless; Parallel computing; Computer hardware; Telecommunications","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.001631474,0.0003513042,0.0003994049,0.0002318199,0.0003379112,0.0002570458,0.0007003938,0.0002400947,0.000013363],"category_scores_gemma":[0.00005934851,0.0003274279,0.00005040066,0.0004467481,0.0002129731,0.0008748034,0.0002077431,0.0002569104,0.000008058832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001064839,"about_ca_system_score_gemma":0.00007528966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001262107,"about_ca_topic_score_gemma":0.000120223,"domain_scores_codex":[0.9975786,0.00008183019,0.0005396096,0.0007680455,0.000307887,0.0007240429],"domain_scores_gemma":[0.9978613,0.0007944194,0.0002435828,0.000623234,0.0003067695,0.0001706939],"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.0008962034,0.0003572358,0.01923117,0.0002441407,0.0002253671,0.00004359235,0.001804169,0.01688087,0.02158447,0.1467945,0.01510745,0.7768308],"study_design_scores_gemma":[0.001237448,0.0006457144,0.003603337,0.0001084462,0.00003103861,0.0001996097,0.00009295753,0.8137658,0.173919,0.004737142,0.0008473356,0.000812136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1904419,0.0001018106,0.8062464,0.0001557067,0.0009087711,0.0006310206,0.000003235957,0.001063206,0.0004478889],"genre_scores_gemma":[0.5933721,0.00007565635,0.4059373,0.0002361324,0.0001091196,0.00001311933,0.000004483889,0.00002434572,0.0002276903],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.796885,"threshold_uncertainty_score":0.9999178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01620132885041503,"score_gpt":0.2526243120765192,"score_spread":0.2364229832261042,"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."}}