580 California St., Suite 400
San Francisco, CA, 94104
Key research themes
1. How can new bounds and constructions improve the understanding and application of ternary and higher-weight constant-weight codes in coding theory?
This research theme focuses on the construction, bounds, and optimization of constant-weight codes over larger alphabets such as ternary codes. It aims to improve code parameters like size, minimum distance, and weight, which are critical for error-correction performance and applications in communications and cryptography. The work uses algorithmic approaches such as lexicographic code constructions and greedy algorithms to extend known bounds and create optimal or near-optimal codes. This allows both theoretical advancement and practical code generation for improved coding schemes.
Key finding: Presents new lower bounds for A_3(n,d,w), the maximum size of ternary constant-weight codes, by employing lexicographic codes constructed with greedy algorithms. Specifically, codes of length n from 5 to 10 and minimum... Read more
Key finding: Demonstrates a generalization that consta-cyclic codes of composite length can be expressed as quasi-twisted codes, enabling the computer-based construction of numerous quasi-twisted two-weight codes. The paper identifies... Read more
Key finding: Investigates generalized Hamming weights (GHWs) of three classes of linear codes, constructed through defining sets, and determines the GHWs for several cases, particularly solving an open problem in the semiprimitive case... Read more
2. What novel algebraic and combinatorial methods allow computation and bounding of generalized Hamming weights in binary and cyclic codes?
This research area investigates methods to compute or tightly bound the generalized Hamming weights (GHWs) of binary linear codes, including BCH codes and their duals, which reflect code performance beyond minimum distances and have applications in error detection/correction and cryptography. It includes the use of algebraic geometry tools such as graded free resolutions, binomial ideals, and Gröbner bases, as well as combinatorial structures of codeword supports and minimal codewords. Such methods aim to overcome computational challenges to determine GHWs more efficiently and understand their implications.
Key finding: Introduces an approach linking the computation of the first and second generalized Hamming weights of binary linear codes to graded free resolutions of monomial ideals associated with subsets of codewords, notably a Gröbner... Read more
Key finding: Develops foundational properties and theoretical machinery for generalized Hamming weights of linear codes, including BCH codes. Notably, shows for double-error-correcting BCH(2^m,5) codes that d_2=8 and extends to higher... Read more
Key finding: Employs additive character sums and Gauss periods to establish explicit expressions and partial determinations for generalized Hamming weights of three classes of linear codes defined by special subsets (defining sets). The... Read more
3. How can geometric and combinational properties of subsets of the Hamming cube inform bounds on distance matrices and related metric properties?
This line of research studies finite metric spaces formed by subsets of the Hamming cube, focusing particularly on the relationship between their distance matrices and underlying geometric structures like affine independence. It explores how classical results on trees and distance matrices extend to general subsets, and uses concepts such as negative type metrics and S-embeddings to establish bounds on quantities related to inverses of distance matrices, with implications for combinatorial optimization and metric geometry.
Key finding: Proves that for n+1 affinely independent points in the Hamming cube H_n, the sum of all entries in the inverse of their distance matrix is at least 2/n, confirming a conjecture that the minimum is attained by unweighted... Read more