{"id":"W2166470077","doi":"10.1109/icip.2010.5651801","title":"Oversampled Filter Banks with instantaneous erasures","year":2010,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Erasure; Redundancy (engineering); Algorithm; Computer science; Frame (networking); Erasure code; Filter bank; Puncturing; Filter (signal processing); Binary erasure channel; Mathematics; Theoretical computer science; Channel (broadcasting); Decoding methods; Telecommunications; Channel capacity; Computer vision","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.00006593303,0.00008960126,0.00006815152,0.00005173197,0.00004974898,0.0003559573,0.0003644845,0.00002340198,0.0003320068],"category_scores_gemma":[0.000009678323,0.00006289729,0.00002081104,0.0001465134,0.00002395058,0.000795782,0.00006518069,0.00008602827,0.00008889053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007600211,"about_ca_system_score_gemma":0.00003884896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003889661,"about_ca_topic_score_gemma":0.0002081304,"domain_scores_codex":[0.9992827,0.000009728802,0.0001052882,0.0002123339,0.0002083885,0.0001815601],"domain_scores_gemma":[0.9994818,0.00004430403,0.00002970718,0.0003287315,0.00004665656,0.00006882699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005448375,0.0001468595,0.003635217,0.00001230569,0.00005251379,0.0001442412,0.001071907,0.000009153941,0.06806609,0.6425247,0.02292037,0.2613622],"study_design_scores_gemma":[0.007244718,0.003464642,0.06465647,0.00005200527,0.00004303917,0.002129634,0.000238687,0.0344715,0.2550784,0.04527965,0.5843047,0.003036506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1124857,0.000002397323,0.7366843,0.0005640197,0.0003430215,0.0001867868,0.000005269049,0.0002872022,0.1494413],"genre_scores_gemma":[0.9252551,4.554482e-7,0.07218686,0.001021496,0.00002894412,0.000006165761,0.000005084671,0.000005711584,0.001490136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8127695,"threshold_uncertainty_score":0.3635242,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01022100057478027,"score_gpt":0.2199069689756226,"score_spread":0.2096859684008423,"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."}}