{"id":"W1533424905","doi":"10.1109/pimrc.2005.1651608","title":"Improved Upper Bound for Erasure Recovery in Binary Product Codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Erasure; Online codes; Erasure code; Tornado code; Decoding methods; Computer science; Hamming code; Hamming distance; Code (set theory); Binary number; Binary erasure channel; Upper and lower bounds; Algorithm; Focus (optics); Product (mathematics); Block code; Mathematics; Arithmetic; Telecommunications","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.003138041,0.001690803,0.001449253,0.002642697,0.0007476605,0.002765072,0.002031927,0.00163784,0.004636539],"category_scores_gemma":[0.02351897,0.0006206402,0.000749339,0.001880215,0.002094193,0.004860097,0.002696101,0.002945664,0.001228802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002299397,"about_ca_system_score_gemma":0.001409348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001476432,"about_ca_topic_score_gemma":0.001281537,"domain_scores_codex":[0.9965369,0.0006047348,0.0001291593,0.0002942282,0.001961306,0.0004737044],"domain_scores_gemma":[0.9884701,0.007806204,0.0005842486,0.001379742,0.001594566,0.0001652032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003462443,0.0001366216,0.0009537855,0.0004776383,0.00006798988,0.0004108045,0.0002886649,0.6080369,0.01908888,0.3074571,0.003283037,0.05945226],"study_design_scores_gemma":[0.00001081504,0.00007583846,0.0003148583,0.0001173083,0.00002771643,0.0002222237,0.00003813383,0.9185685,0.009094751,0.06927335,0.002211168,0.00004537513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04775199,0.007607959,0.9178978,0.0006612232,0.000218729,0.00007965331,0.0002505911,0.001134248,0.0243979],"genre_scores_gemma":[0.8317772,0.00729266,0.1529745,0.0004955973,0.0003560297,0.0002438977,0.000438935,0.0003652009,0.006055905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004636539,"threshold_uncertainty_score":0.0166834,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01131494764283105,"score_gpt":0.2383108564525677,"score_spread":0.2269959088097366,"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."}}