{"id":"W2951961520","doi":"10.48550/arxiv.1103.3641","title":"On the Pseudocodeword Redundancy of Binary Linear Codes","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Science Foundation Ireland; National Research Foundation Singapore; National Research Foundation","keywords":"Hamming code; Redundancy (engineering); Mathematics; Linear code; Hamming distance; Combinatorics; Eigenvalues and eigenvectors; Binary number; Upper and lower bounds; Discrete mathematics; Parity-check matrix; Row; Block code; Low-density parity-check code; Algorithm; Computer science; Arithmetic; Decoding methods; Physics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005262824,0.0003460926,0.0003860137,0.0003074404,0.0001599635,0.00003815219,0.003940978,0.000306513,0.00004070523],"category_scores_gemma":[0.0001381249,0.000305287,0.000283017,0.0006586454,0.0002299083,0.0001857194,0.00288541,0.0009721659,0.00005382363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001187547,"about_ca_system_score_gemma":0.0002040519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000296864,"about_ca_topic_score_gemma":0.00002955833,"domain_scores_codex":[0.9980165,0.000287355,0.0002660509,0.0009788724,0.0001324119,0.0003187675],"domain_scores_gemma":[0.9962052,0.0004221117,0.0004858353,0.002570296,0.0002277174,0.00008880324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006024577,0.0002231396,0.0008533858,0.00008951544,0.00009210864,0.0001781341,0.0008124852,0.01088944,0.0003078338,0.9841194,0.001988427,0.0003859031],"study_design_scores_gemma":[0.0003216378,0.000569139,0.001261809,0.0009184708,0.0001242167,0.00001392245,0.0001184807,0.3492931,0.01402858,0.6319446,0.0003698043,0.00103619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.567927,0.00005634022,0.4111386,0.0001912851,0.0008360202,0.0005634275,0.00001190119,0.0009247884,0.01835066],"genre_scores_gemma":[0.9911967,0.0001167284,0.007423346,0.0001144906,0.00003989274,0.000002368937,0.000002854929,0.0000256456,0.001078009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4232696,"threshold_uncertainty_score":0.9999399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1089428483385994,"score_gpt":0.2094231181614024,"score_spread":0.100480269822803,"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."}}