The following pages link to Sihuang Hu (Q326340):
Displaying 20 items.
- There is no \([24,12,9]\) doubly-even self-dual code over \(\mathbb F_4\) (Q326341) (← links)
- Difference sets with few character values (Q404936) (← links)
- Association schemes related to Delsarte-Goethals codes (Q478360) (← links)
- New pseudo-planar binomials in characteristic two and related schemes (Q498987) (← links)
- Necessary conditions and frame constructions for \(\mathbb Z\)-cyclic patterned starter whist tournaments (Q713315) (← links)
- Low dimensional strongly perfect lattices. IV: The dual strongly perfect lattices of dimension 16 (Q2009162) (← links)
- The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs (Q2989272) (← links)
- Strongly perfect lattices sandwiched between Barnes–Wall lattices (Q3304709) (← links)
- On the VC-Dimension of Binary Codes (Q4583427) (← links)
- A Bound on the Shannon Capacity via a Linear Programming Variation (Q4584958) (← links)
- Quickest Sequence Phase Detection (Q4589411) (← links)
- Some New Results on ‐Cyclic Patterned Starter Whist Tournaments and Related Frames (Q4929249) (← links)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
- The $\rho $ -Capacity of a Graph (Q5280894) (← links)
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes (Q5375529) (← links)
- Constructing MSR Codes With Subpacketization 2<sup> <i>n</i>/3</sup> for <i>k</i> + 1 Helper Nodes (Q6118299) (← links)
- Adjacent-Bits-Swapped Polar Codes: A New Code Construction to Speed up Polarization (Q6153668) (← links)
- ABS\(+\) polar codes: exploiting more linear transforms on adjacent bits (Q6576023) (← links)
- Optimal \((2, \delta)\) locally repairable codes via punctured simplex codes (Q6651899) (← links)
- MSR codes with linear field size and smallest sub-packetization for any number of helper nodes (Q6670221) (← links)
