The following pages link to Hengjia Wei (Q390274):
Displaying 36 items.
- Group divisible designs with block size four and group type \(g^um^1\) for more small \(g\) (Q390275) (← links)
- Optimal ternary constant-composition codes with weight four and distance six (Q482203) (← links)
- Spectrum of sizes for perfect 2-deletion-correcting codes of length 4 (Q488256) (← links)
- Group divisible designs with block size four and group type \(g^um^1\) (Q488264) (← links)
- Completely reducible super-simple designs with block size five and index two (Q494593) (← links)
- Generic constructions for partitioned difference families with applications: a unified combinatorial approach (Q510413) (← links)
- Some more 5-GDDs, 4-frames and 4-RGDDs (Q740653) (← links)
- Uniformly resolvable designs with block sizes 3 and 4 (Q897301) (← links)
- Group divisible designs with block sizes from \(K_{1(3)}\) and Kirkman frames of type \(h^u m^1\) (Q2017046) (← links)
- On tilings of asymmetric limited-magnitude balls (Q2065124) (← links)
- Kirkman frames having hole type \(h^um^1\) for \(h\equiv\mathrm{mod}\,12\) (Q2249781) (← links)
- Some more uniformly resolvable designs with block sizes 2 and 4 (Q2359967) (← links)
- A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo \(p\) (Q2411601) (← links)
- The Existence of Well-Balanced Triple Systems (Q2808800) (← links)
- A New Construction of Group Divisible Designs with Nonuniform Group Type (Q2817305) (← links)
- New Bounds and Constructions for Multiply Constant-Weight Codes (Q2976510) (← links)
- Optimal Groomings with Grooming Ratios Six and Seven (Q3465908) (← links)
- (Q4570855) (← links)
- Directed PBDs with Block Sizes from K Where K (Q4600164) (← links)
- Group divisible covering designs with block size four (Q4642159) (← links)
- On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls (Q4958211) (← links)
- On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks (Q4958249) (← links)
- Improved Coding Over Sets for DNA-Based Data Storage (Q5030273) (← links)
- Nearly Optimal Robust Positioning Patterns (Q5030278) (← links)
- On the Generalized Covering Radii of Reed-Muller Codes (Q5088561) (← links)
- Sequence Reconstruction for Limited-Magnitude Errors (Q5088564) (← links)
- Low-Power Cooling Codes With Efficient Encoding and Decoding (Q5124465) (← links)
- Efficient and Explicit Balanced Primer Codes (Q5124507) (← links)
- On Private Information Retrieval Array Codes (Q5211388) (← links)
- Burst-Deletion-Correcting Codes for Permutations and Multipermutations (Q5211645) (← links)
- Robust Positioning Patterns with Low Redundancy (Q5221262) (← links)
- Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms (Q5236318) (← links)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
- Group Divisible Designs with Block Size Four and Group Type for (Q5406956) (← links)
- Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors (Q6193572) (← links)
- On the Gap between Scalar and Vector Solutions of Generalized Combination Networks (Q6332764) (← links)