{"id":"W2149562977","doi":"10.1109/isit.2010.5513622","title":"Recursive convolutional codes for time-invariant LDPC convolutional codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Encoder; Low-density parity-check code; Turbo code; Serial concatenated convolutional codes; Computer science; Algorithm; Decoding methods; Linear code; Theoretical computer science; Block code; Mathematics","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.0008649815,0.0002402405,0.000269959,0.0001586623,0.0003400192,0.0001499058,0.001162344,0.0001949942,0.0002555575],"category_scores_gemma":[0.0005863207,0.0002262702,0.0001526079,0.0002632418,0.0002289809,0.0004921999,0.0002855812,0.0003508503,0.0002207925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008588966,"about_ca_system_score_gemma":0.0003835688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009473134,"about_ca_topic_score_gemma":0.0001584147,"domain_scores_codex":[0.9980677,0.00006938232,0.0003505374,0.0006322772,0.0003972648,0.0004828142],"domain_scores_gemma":[0.9974826,0.0009471069,0.0001664545,0.0006286463,0.000614644,0.0001605636],"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.00002045642,0.00009725072,0.0004961396,0.000009963899,0.00003177169,0.000003703546,0.0001414122,0.00001105614,0.03362321,0.9091306,0.05531735,0.001117034],"study_design_scores_gemma":[0.001610832,0.0006692941,0.005496187,0.00009098314,0.00004934576,0.0004340954,0.000070436,0.4241849,0.1097288,0.3896827,0.06645916,0.001523324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007731755,0.0000391475,0.9763808,0.002791874,0.001220983,0.0005804613,0.00006409749,0.001379901,0.009810944],"genre_scores_gemma":[0.3379437,0.00000351842,0.6568997,0.0008145561,0.0002885949,0.0001600653,0.00004345398,0.00002243102,0.003823965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.519448,"threshold_uncertainty_score":0.9227031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01387577364850146,"score_gpt":0.2671057671950604,"score_spread":0.253229993546559,"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."}}