{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209107,0.0009706796,0.001144609,0.002415375,0.001447603,0.002266231,0.002320984,0.001277412,0.003872241],"category_scores_gemma":[0.02541688,0.0005809961,0.0006547974,0.002326044,0.003380712,0.006005645,0.003978459,0.002089426,0.0006312934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003027849,"about_ca_system_score_gemma":0.0009061733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00263872,"about_ca_topic_score_gemma":0.001326588,"domain_scores_codex":[0.9975745,0.0005648898,0.0000974525,0.0003800909,0.0008801586,0.0005029375],"domain_scores_gemma":[0.9811394,0.01310815,0.001767267,0.001461236,0.001413259,0.001110775],"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.0003323664,0.00006801499,0.004015428,0.0002747432,0.00005123955,0.0002296634,0.0006842738,0.09142537,0.004751487,0.8772014,0.002539701,0.01842635],"study_design_scores_gemma":[0.00002713533,0.00011674,0.002177339,0.0001057222,0.00003044806,0.0004735548,0.0002804853,0.3839811,0.006583065,0.6025469,0.003594838,0.00008268971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4985057,0.005543406,0.4634624,0.001964991,0.0001330515,0.000114708,0.000894997,0.0004348443,0.02894594],"genre_scores_gemma":[0.9654552,0.002269225,0.02725645,0.0001829393,0.0002304048,0.0001655598,0.000490818,0.0001293791,0.00382001],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003872241,"threshold_uncertainty_score":0.02196872,"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."}}