{"id":"W2115515841","doi":"10.1109/iccsc.2008.15","title":"High Throughput Parallel Decoder Design for LDPC Convolutional Codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Parallel computing; Throughput; Soft-decision decoder; Convolutional code; Code (set theory); Dimension (graph theory); Node (physics); Serial concatenated convolutional codes; Decoding methods; Concatenated error correction code; Algorithm; Block code; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003507549,0.0001655877,0.0001951677,0.00007513535,0.0003018677,0.00004783128,0.0008052096,0.00008862917,0.00003876563],"category_scores_gemma":[0.0001073963,0.0001480622,0.00008070633,0.0001824814,0.00009304463,0.0004295807,0.000161955,0.00009919243,0.00006452588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006904591,"about_ca_system_score_gemma":0.0001683326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001198404,"about_ca_topic_score_gemma":0.00002351384,"domain_scores_codex":[0.9986533,0.00006405303,0.0002423586,0.0004440378,0.0002465092,0.0003497374],"domain_scores_gemma":[0.9986184,0.0005384531,0.00008048322,0.0004801394,0.0002094111,0.00007315528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004469723,0.0001899983,0.001243298,0.00001501355,0.00005031129,0.00002310206,0.0006861661,0.003161172,0.001111884,0.698555,0.2917587,0.003160692],"study_design_scores_gemma":[0.001842302,0.0008522778,0.005201316,0.00004162164,0.00002102984,0.000564385,0.0000385907,0.6452967,0.04987865,0.2755672,0.01936831,0.001327594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002263201,0.00007699466,0.9934618,0.0008538307,0.0003660042,0.0004236502,0.000002807088,0.001385841,0.001165877],"genre_scores_gemma":[0.2812858,0.00001720963,0.7166016,0.0006362947,0.00006116156,0.0001080617,0.000003459406,0.00001126212,0.001275186],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6421355,"threshold_uncertainty_score":0.60378,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07444156334132539,"score_gpt":0.2891477881057698,"score_spread":0.2147062247644444,"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."}}