{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001349018,0.0008601332,0.0005750089,0.002569423,0.000480523,0.0009127789,0.0007887848,0.0008379371,0.001689693],"category_scores_gemma":[0.01232731,0.0004226592,0.000311684,0.00165348,0.001642435,0.001663125,0.001085913,0.001348143,0.0005326355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007991872,"about_ca_system_score_gemma":0.0005558507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006400406,"about_ca_topic_score_gemma":0.0005258467,"domain_scores_codex":[0.9980908,0.0005237256,0.0000747501,0.0001529939,0.0009643535,0.0001933477],"domain_scores_gemma":[0.9919743,0.005778642,0.0006140682,0.0007167733,0.000798681,0.000117559],"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.0005452854,0.00007447814,0.00247102,0.0004478644,0.00005146429,0.0006944494,0.0004702098,0.248717,0.02672964,0.6290936,0.004678478,0.08602656],"study_design_scores_gemma":[0.00002342587,0.0001628191,0.001197858,0.0001500618,0.00002494189,0.0006214576,0.00007830069,0.602026,0.01056132,0.381225,0.003866543,0.00006215474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3670738,0.0086776,0.5905185,0.00133037,0.0002271382,0.00006706789,0.0004535866,0.0005198934,0.03113205],"genre_scores_gemma":[0.9401677,0.003510326,0.05164998,0.0001712397,0.0003821346,0.0001224541,0.0003444565,0.0001109977,0.003540663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002569423,"threshold_uncertainty_score":0.007134378,"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."}}