{"id":"W2123414183","doi":"10.1109/glocom.2006.79","title":"CTH08-5: Efficient Encoding and Termination of Low-Density Parity-Check Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Low-density parity-check code; Computer science; Algorithm; Convolutional code; Encoding (memory); Serial concatenated convolutional codes; Block code; Code (set theory); Computational complexity theory; Decoding methods; Linear code; Theoretical computer science; Artificial intelligence","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.0006265123,0.00040097,0.0003250603,0.0005520944,0.0003983775,0.0005642295,0.0006416307,0.0005392128,0.002076107],"category_scores_gemma":[0.00168849,0.0001112388,0.0001850478,0.0005622949,0.0003986565,0.0004491116,0.0004732368,0.0005806437,0.0007660135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006804019,"about_ca_system_score_gemma":0.001243235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001831939,"about_ca_topic_score_gemma":0.002159573,"domain_scores_codex":[0.9995754,0.00007896033,0.00002510846,0.00003377051,0.0002320859,0.00005461864],"domain_scores_gemma":[0.9993093,0.0001809593,0.00006876343,0.0001548812,0.0002559368,0.00003025226],"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.0008508919,0.0001577237,0.002425207,0.0003770495,0.00006110509,0.0007554929,0.0001927606,0.1338186,0.1854176,0.1172484,0.02166766,0.5370274],"study_design_scores_gemma":[0.0001095965,0.0003385293,0.0009193632,0.00004925779,0.00002607874,0.0006025925,0.00001655255,0.6974043,0.2592119,0.01267422,0.02860417,0.00004343189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06961058,0.0005912847,0.9100993,0.0002341052,0.0001605416,0.0002446007,0.000517118,0.002811478,0.01573107],"genre_scores_gemma":[0.535001,0.0004444529,0.4466475,0.0001483088,0.00008739803,0.0002155694,0.001782457,0.0002228629,0.01545037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002076107,"threshold_uncertainty_score":0.006945312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007769916617639139,"score_gpt":0.2334236396745022,"score_spread":0.225653723056863,"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."}}