The following pages link to Can Xiang (Q301632):
Displaying 22 items.
- Linear codes from a generic construction (Q301633) (← links)
- A class of linear codes with a few weights (Q502407) (← links)
- Secret sharing schemes for compartmented access structures (Q520077) (← links)
- Linear codes with few weights from inhomogeneous quadratic functions (Q521872) (← links)
- Two classes of linear codes and their weight distributions (Q1647743) (← links)
- Two families of subfield codes with a few weights (Q2040337) (← links)
- Two constructions of low-hit-zone frequency-hopping sequence sets (Q2085708) (← links)
- A further construction of asymptotically optimal codebooks with multiplicative characters (Q2280311) (← links)
- Combinatorial \(t\)-designs from quadratic functions (Q2302155) (← links)
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\) (Q2672291) (← links)
- Some \(t\)-designs from BCH codes (Q2673776) (← links)
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound (Q2977160) (← links)
- A Construction of Linear Codes Over ${\mathbb {F}}_{2^t}$ From Boolean Functions (Q2979089) (← links)
- (Q3052178) (← links)
- Shortened Linear Codes From APN and PN Functions (Q5088507) (← links)
- Complete Characterization of Generalized Bent and 2<sup>k</sup>-Bent Boolean Functions (Q5358594) (← links)
- Some shortened codes from linear codes constructed by defining sets (Q6112207) (← links)
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\) (Q6144448) (← links)
- Some 3-designs and shortened codes from binary cyclic codes with three zeros (Q6156911) (← links)
- Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\) (Q6157857) (← links)
- New frequency-hopping sequence sets with good parameters under aperiodic Hamming correlation (Q6159435) (← links)
- Some subfield codes from MDS codes (Q6167298) (← links)
