{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000229185,0.000102888,0.0001230388,0.00007983567,0.00008512646,0.000161488,0.000417268,0.0000396084,0.00001315582],"category_scores_gemma":[0.00001995225,0.00007877684,0.00004205492,0.0001870918,0.00001724354,0.0007316982,0.0001824822,0.00006396142,0.000008305217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002872099,"about_ca_system_score_gemma":0.00006053338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003957135,"about_ca_topic_score_gemma":0.0001255439,"domain_scores_codex":[0.9990543,0.00002068726,0.0001809901,0.0003999486,0.0001071228,0.0002369476],"domain_scores_gemma":[0.9993677,0.00005759241,0.00004089381,0.0004548272,0.00005094246,0.00002805731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002917893,0.001440678,0.00820516,0.0001848343,0.00003584615,0.00004249842,0.0002583026,0.001472265,0.1392936,0.053928,0.4072983,0.3875487],"study_design_scores_gemma":[0.002062599,0.0006943581,0.04017485,0.00008952,0.000007475042,0.00002412719,0.00002764635,0.7756228,0.0326033,0.0399658,0.1078675,0.0008600173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1223342,0.0009002858,0.869707,0.001901923,0.0009991764,0.0008294196,0.00003228732,0.0002620271,0.003033614],"genre_scores_gemma":[0.3886653,0.00003349757,0.5987856,0.0005993067,0.0005924576,0.0001486879,0.0001029957,0.00002624764,0.01104588],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7741506,"threshold_uncertainty_score":0.3212426,"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."}}