The following pages link to Kenneth W. Shum (Q517729):
Displaying 35 items.
- Cooperative repair of multiple node failures in distributed storage systems (Q517731) (← links)
- Optimal conflict-avoiding codes of odd length and weight three (Q2248642) (← links)
- Optimal three-dimensional optical orthogonal codes of weight three (Q2339139) (← links)
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes (Q2638410) (← links)
- (Q2712129) (← links)
- BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems (Q2976755) (← links)
- Linear Network Coding for Erasure Broadcast Channel With Feedback: Complexity and Algorithms (Q2976837) (← links)
- Imperfect Secrecy in Wiretap Channel II (Q2978843) (← links)
- (Q3169306) (← links)
- Strongly Conflict-Avoiding Codes (Q3225103) (← links)
- (Q3374402) (← links)
- Stability of distributed power and signature sequence control for CDMA Systems-a game-theoretic framework (Q3547678) (← links)
- User-Irrepressible Sequences (Q3588578) (← links)
- Sum Capacity of One-Sided Parallel Gaussian Interference Channels (Q3604536) (← links)
- (Q3635548) (← links)
- On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound (Q4544599) (← links)
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound (Q4544665) (← links)
- The Rate Region for Secure Distributed Storage Systems (Q4566542) (← links)
- Proxy-Assisted Regenerating Codes With Uncoded Repair for Distributed Storage Systems (Q4569201) (← links)
- (Q4570858) (← links)
- (Q4664645) (← links)
- Tight bounds for Chevalley–Warning–Ax–Katz type estimates, with improved applications (Q4812522) (← links)
- Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback (Q4975933) (← links)
- Multichannel Conflict-Avoiding Codes of Weights Three and Four (Q5001739) (← links)
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach (Q5138908) (← links)
- On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point (Q5211591) (← links)
- Fractional Repetition Codes With Optimal Reconstruction Degree (Q5211647) (← links)
- Rack-Aware Regenerating Codes for Data Centers (Q5224107) (← links)
- Construction and Applications of CRT Sequences (Q5281231) (← links)
- A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes (Q5281394) (← links)
- Cooperative Regenerating Codes (Q5346250) (← links)
- Measure-theoretic probability. With applications to statistics, finance, and engineering (Q6535879) (← links)
- Corrections to: ``Multichannel conflict-avoiding codes of weights three and four'' (Q6576751) (← links)
- Optimal ternary locally repairable codes (Q6591968) (← links)
- Efficient encoding and decoding algorithm for a class of perfect single-deletion-correcting permutation codes (Q6753187) (← links)
