{"id":"W2129128059","doi":"10.1109/vtcf.2006.287","title":"Tandem Filter Bank-DFT Code for Bursty Erasure Correction","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Erasure; Disjoint sets; Algorithm; Filter bank; Quantization (signal processing); Code (set theory); Row; Decoding methods; Encoding (memory); Theoretical computer science; Filter (signal processing); Artificial intelligence; Mathematics; Computer vision; Discrete 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.0001061495,0.0001717934,0.0001967233,0.0001974748,0.0001210001,0.00002941679,0.000384353,0.000335714,0.0000311504],"category_scores_gemma":[0.0000328674,0.0001754089,0.00006516436,0.0002906557,0.0001059131,0.00008025715,0.00002983175,0.0003119356,0.00003618743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005361612,"about_ca_system_score_gemma":0.00002975342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001486074,"about_ca_topic_score_gemma":0.0002474201,"domain_scores_codex":[0.9992012,0.00001475617,0.0002292,0.0002049986,0.00007697707,0.0002728102],"domain_scores_gemma":[0.9991101,0.00004778262,0.00004257393,0.0006124752,0.0001595608,0.0000275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004628638,0.0004897818,0.02267101,0.0001847447,0.0003710264,0.00004102819,0.0001690776,0.04521073,0.6014456,0.04730502,0.1894258,0.09263992],"study_design_scores_gemma":[0.001012543,0.0001198339,0.003711383,0.000116868,0.00007590707,0.00005855353,0.0000549023,0.3424184,0.2128558,0.01063505,0.4282551,0.0006858016],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5592127,0.001643644,0.4288308,0.001436823,0.00168565,0.0006363405,0.00007012695,0.002454499,0.00402945],"genre_scores_gemma":[0.9961104,0.000106468,0.00286978,0.00002957907,0.00006898313,0.0001929113,0.00003925106,0.0000295279,0.0005530733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4368977,"threshold_uncertainty_score":0.7152969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01485730134829395,"score_gpt":0.2282898671645422,"score_spread":0.2134325658162483,"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."}}