國立清華大學 數學系

Speaker：俞韋亘 教授(中央數學系)
Time：2025.09.15 (Mon.) 16:00 – 17:00
Venue：第三綜合大樓2F 201
Tea time：15:30, Room 707
Abstract：We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main results, we determine the exact size of maximal binary codes with two distances for all lengths n≥6 as well as the exact size of maximal binary constant weight codes with 2,3, and 4 distances for several values of the weight and for all but small length. In the end, we will also mention new results of maximum two-distance sets in R^n for 9<=n<=14.