{"id":"W2171226783","doi":"10.1109/acssc.2004.1399318","title":"On a recursive structure of binary hamming codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Hamming weight; Hamming code; Linear code; Block code; Hamming(7,4); Hamming graph; Hamming bound; Mathematics; Hamming distance; Discrete mathematics; Concatenated error correction code; Algorithm; Binary number; Combinatorics; Decoding methods; Arithmetic","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.000502078,0.0003842309,0.0003371875,0.001022062,0.0005797463,0.0009312265,0.0005813609,0.0005881882,0.003008868],"category_scores_gemma":[0.003301252,0.0002323966,0.0003471465,0.0009229568,0.001119477,0.001415943,0.0009402282,0.001014568,0.001037362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005535394,"about_ca_system_score_gemma":0.0005013922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006619397,"about_ca_topic_score_gemma":0.0007647459,"domain_scores_codex":[0.9993634,0.0001368489,0.00003736941,0.00008517653,0.0002652483,0.00011205],"domain_scores_gemma":[0.9986622,0.0006301487,0.0001584836,0.0002252091,0.0002779922,0.00004596884],"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.00003170846,0.00001258701,0.0002362933,0.00005123948,0.000003978555,0.00009369628,0.0001537162,0.01480107,0.008327458,0.9510557,0.0005856418,0.02464694],"study_design_scores_gemma":[0.00001713537,0.000073829,0.000376467,0.00006128816,0.000009820434,0.0003404786,0.00004726043,0.1768213,0.01700977,0.7958078,0.009398782,0.00003612341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1122414,0.0006837943,0.8568054,0.0002768076,0.00007341822,0.00008221644,0.0002021761,0.000252204,0.02938267],"genre_scores_gemma":[0.6471162,0.001096608,0.3355242,0.0002433319,0.000146193,0.0001980481,0.0004295488,0.0001872694,0.01505856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003008868,"threshold_uncertainty_score":0.01006567,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006776856515209622,"score_gpt":0.2405214121545984,"score_spread":0.2337445556393888,"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."}}