{"id":"W2136633702","doi":"10.1109/isit.2011.6033971","title":"Density and bounds for Grassmannian codes with chordal distance","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Grassmannian; Cardinality (data modeling); Hamming distance; Combinatorics; Minimum distance; Mathematics; Generalization; Upper and lower bounds; Hamming code; Code (set theory); RADIUS; Discrete mathematics; Hamming bound; Chordal graph; Decoding methods; Computer science; Algorithm; Block code; Mathematical analysis","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.0001445401,0.00007033207,0.00007506858,0.00003146717,0.0001489429,0.00007545236,0.000232242,0.00001796771,0.000005313717],"category_scores_gemma":[0.000004441888,0.00005097731,0.00002392582,0.0001206102,0.00009275809,0.000210687,0.00005397418,0.00003174549,0.000001242637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003314326,"about_ca_system_score_gemma":0.000009986391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001362176,"about_ca_topic_score_gemma":0.0001530607,"domain_scores_codex":[0.9995252,0.00001319018,0.00005481255,0.0002089688,0.00005753476,0.000140327],"domain_scores_gemma":[0.9996199,0.00003525652,0.00002205532,0.0002302186,0.00003537273,0.00005718198],"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.00004558867,0.0000242235,0.01613025,0.000007005412,0.00001038902,0.000002291706,0.0005274845,8.013605e-8,0.0000497781,0.9777869,0.0001373264,0.005278708],"study_design_scores_gemma":[0.001042954,0.001024801,0.1419183,0.00003379966,0.00002585749,0.00005123643,0.0001324006,0.00342991,0.008962939,0.8321772,0.0106285,0.0005721831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1620984,0.00002424147,0.8312477,0.00007902616,0.00004452679,0.00007576132,8.035058e-7,0.0000993488,0.006330132],"genre_scores_gemma":[0.9083504,0.000002447498,0.09130976,0.0001414483,0.00001128814,0.000009626252,3.199816e-7,0.000002940828,0.0001717327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.746252,"threshold_uncertainty_score":0.2078794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01906008839517559,"score_gpt":0.2071392286488062,"score_spread":0.1880791402536306,"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."}}