January 01, 1995 article Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces IEEE Transactions on Information Theory DOI: 10.1109/18.412678 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 152 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Smoothing Codes and Lattices: Systematic Study and New Bounds 2023 IEEE Transactions on Information Theory article Computer Science Cryptography and Data Security Open access 13 citations 1 result References 0