{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000485575,0.0004832798,0.0003632587,0.0004680114,0.0003576857,0.0005438412,0.0004574884,0.0008772685,0.00294151],"category_scores_gemma":[0.001879195,0.000158978,0.0001956089,0.0007503201,0.0005941415,0.0006454431,0.0004972306,0.0006027179,0.0007390051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006574641,"about_ca_system_score_gemma":0.001037096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001541922,"about_ca_topic_score_gemma":0.003342105,"domain_scores_codex":[0.9996133,0.00006297474,0.00001561134,0.00005474013,0.0002137659,0.00003962759],"domain_scores_gemma":[0.9991327,0.0002849623,0.0001267261,0.0001822048,0.0002383542,0.00003507452],"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.00071321,0.00009974478,0.001327817,0.0002491499,0.00005657902,0.0006754037,0.000162918,0.1328839,0.16478,0.3932315,0.005229259,0.3005905],"study_design_scores_gemma":[0.00004369175,0.0001966197,0.0005355147,0.00005626205,0.00003074878,0.0009208703,0.00003083797,0.8673984,0.0871175,0.02758484,0.01603016,0.00005463068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0255104,0.0006080526,0.9699772,0.0002520761,0.0001620578,0.00004293399,0.0001336471,0.0004066617,0.002906963],"genre_scores_gemma":[0.50692,0.0008524192,0.4775057,0.000262593,0.0001605611,0.0001203816,0.0003177127,0.00008571149,0.013775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00294151,"threshold_uncertainty_score":0.009840369,"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."}}