Kenneth W. Shum

Orcid: 0000-0001-6505-6177

According to our database1, Kenneth W. Shum authored at least 149 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Several Classes of Optimal Cyclic Locally Repairable Codes of Unbounded Code Lengths.
CoRR, 2023

Power Allocation and Data Assignment for Over-The-Air Distributed Learning.
Proceedings of the 21st International Symposium on Modeling and Optimization in Mobile, 2023

Data Allocation for Approximate Gradient Coding in Edge Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2023

ISAA: Boost Repair Process by Constructing the Degree Constrained Optimal Repair Tree for Erasure-coded Systems.
Proceedings of the 29th IEEE International Conference on Parallel and Distributed Systems, 2023

Bayesian Inference and Greedy Task Allocation for Edge Computing Systems with Uncertainty.
Proceedings of the IEEE International Conference on Communications, 2023

Secure Fractional Repetition Codes for Distributed Storage Systems.
Proceedings of the IEEE Global Communications Conference, 2023

2022
An Improved Bound and Singleton-Optimal Constructions of Fractional Repetition Codes.
IEEE Trans. Commun., 2022

G-Update: A Group-based Update Scheme for Heterogenous Erasure-coded Storage Systems.
Proceedings of the 24th IEEE Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, 2022

A Genetic Algorithm-based Construction of Fractional Repetition Codes.
Proceedings of the IEEE Global Communications Conference, 2022

2021
High-Dimensional Superposition NOMA and its User Pairing Strategy.
IEEE Trans. Wirel. Commun., 2021

Schedule Sequence Design for Broadcast in Multi-Channel Ad Hoc Networks.
IEEE Trans. Veh. Technol., 2021

Multichannel Conflict-Avoiding Codes of Weights Three and Four.
IEEE Trans. Inf. Theory, 2021

On the Rate Region of Symmetric Multilevel Imperfect Secret Sharing.
IEEE Trans. Commun., 2021

Sequence-Based Schemes for Broadcast and Unicast under Frequency Division Duplex.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Repeated-Root Constacyclic Codes With Pair-Metric.
IEEE Commun. Lett., 2021

Optimal Quaternary (r, delta)-Locally Repairable Codes Achieving the Singleton-type Bound.
CoRR, 2021

Repeated-root Constacyclic Codes with Optimal Locality.
CoRR, 2021

Solving Monoshift Systems and Applications in Random Coding.
Proceedings of the IEEE International Symposium on Information Theory, 2021

On Optimal Quaternary Locally Repairable Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Successively Solvable Shift-Add Systems - a Graphical Characterization.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Fractional Repetition Codes With Optimal Reconstruction Degree.
IEEE Trans. Inf. Theory, 2020

On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point.
IEEE Trans. Inf. Theory, 2020

Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach.
IEEE Trans. Inf. Theory, 2020

Sequence-Based Unicast in Wireless Sensor Networks.
IEEE Trans. Commun., 2020

Exact-Repair Codes With Partial Collaboration in Distributed Storage Systems.
IEEE Trans. Commun., 2020

A mixed construction of variable-weight optical orthogonal code for optical code division multiple access networks.
Phys. Commun., 2020

Storage and repair bandwidth tradeoff for heterogeneous cluster distributed storage systems.
Sci. China Inf. Sci., 2020

Optimal Locally Repairable Codes for Parallel Reading.
IEEE Access, 2020

Optimal Locally Repairable Constacyclic Codes of Prime Power Lengths.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Network Coding Based on Byte-wise Circular Shift and Integer Addition.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Spherical Code Superposition NOMA and Its User Pairing Strategy.
Proceedings of the IEEE Global Communications Conference, 2020

On the Optimal Minimum Distance of Fractional Repetition Codes.
Proceedings of the IEEE Global Communications Conference, 2020

2019
New CRT sequence sets for a collision channel without feedback.
Wirel. Networks, 2019

Rack-Aware Regenerating Codes for Data Centers.
IEEE Trans. Inf. Theory, 2019

Mixed construction of OOC for optical code division multiple access networks.
IET Commun., 2019

Capacity of Distributed Storage Systems with Clusters and Separate Nodes.
CoRR, 2019

On the Duality and File Size Hierarchy of Fractional Repetition Codes.
Comput. J., 2019

Lattice-Superposition NOMA for Near-Far Users.
Proceedings of the 2019 International Symposium on Intelligent Signal Processing and Communication Systems, 2019

Classification of Optimal Ternary (r, δ)-Locally Repairable Codes Attaining the Singleton-like Bound.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Optimal Reconstruction Degree of Fractional Repetition Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

CRT Sequences for Medium Access Control.
Proceedings of the 2019 IEEE/CIC International Conference on Communications in China, 2019

Optimal User Pairing in Cache-Based NOMA Systems with Index Coding.
Proceedings of the 2019 IEEE International Conference on Communications, 2019

2018
Proxy-Assisted Regenerating Codes With Uncoded Repair for Distributed Storage Systems.
IEEE Trans. Inf. Theory, 2018

CRT Sequences With Applications to Collision Channels Allowing Successive Interference Cancellation.
IEEE Trans. Inf. Theory, 2018

A Zigzag-Decodable Ramp Secret Sharing Scheme.
IEEE Trans. Inf. Forensics Secur., 2018

A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding.
IEEE Trans. Commun., 2018

A Distributed Unicast Scheme Based on Schedule Sequences in Ad Hoc Networks.
Proceedings of the IEEE Information Theory Workshop, 2018

Symmetric Multilevel Imperfect Secret Sharing.
Proceedings of the IEEE Information Theory Workshop, 2018

On a Simple Characterization of Secure Exact-repair Regenerating Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

On the Maximal Code Length of Optimal Linear Locally Repairable Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
The Rate Region for Secure Distributed Storage Systems.
IEEE Trans. Inf. Theory, 2017

Concurrent regenerating codes.
IET Commun., 2017

Protocol-sequence-based media-access control with successive interference cancellation (invited paper).
Proceedings of the 9th International Conference on Wireless Communications and Signal Processing, 2017

On the duality of fractional repetition codes.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Maximally recoverable codes: Connections to generic network coding and maximal matching.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

2016
Linear Network Coding for Erasure Broadcast Channel With Feedback: Complexity and Algorithms.
IEEE Trans. Inf. Theory, 2016

BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems.
IEEE Trans. Inf. Theory, 2016

Cooperative repair of multiple node failures in distributed storage systems.
Int. J. Inf. Coding Theory, 2016

On the MDS Condition of Blaum-Bruck-Vardy Codes With Large Number Parity Columns.
IEEE Commun. Lett., 2016

Optimal-cost repair in multi-hop distributed storage systems with network coding.
Trans. Emerg. Telecommun. Technol., 2016

New User-Irrepressible Protocol Sequences.
CoRR, 2016

Concurrent Regenerating Codes and Scalable Application in Network Storage.
CoRR, 2016

The rate region of secure exact-repair regenerating codes for 5 nodes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Replicated convolutional codes: A design framework for repair-efficient distributed storage codes.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Imperfect Secrecy in Wiretap Channel II.
IEEE Trans. Inf. Theory, 2015

HFR code: a flexible replication scheme for cloud storage systems.
IET Commun., 2015

Heterogeneity-Aware Codes With Uncoded Repair for Distributed Storage Systems.
IEEE Commun. Lett., 2015

Tradeoff between storage cost and repair cost in heterogeneous distributed storage systems.
Trans. Emerg. Telecommun. Technol., 2015

Optimal three-dimensional optical orthogonal codes of weight three.
Des. Codes Cryptogr., 2015

Lattice network codes over optimal lattices in low dimensions.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

Hermitian codes in distributed storage systems with optimal error-correcting capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Sector-disk codes and partial MDS codes with up to three global parities.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Deep Representation Learning with Target Coding.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Data Dissemination With Side Information and Feedback.
IEEE Trans. Wirel. Commun., 2014

Safety-Message Broadcast in Vehicular Ad Hoc Networks Based on Protocol Sequences.
IEEE Trans. Veh. Technol., 2014

Binary Sequences for Multiple Access Collision Channel: Identification and Synchronization.
IEEE Trans. Commun., 2014

On the Optimum Cyclic Subcode Chains of RM(2, m)<sup>*</sup> for Increasing Message Length.
IEEE Trans. Commun., 2014

General Fractional Repetition Codes for Distributed Storage Systems.
IEEE Commun. Lett., 2014

Optimal conflict-avoiding codes of odd length and weight three.
Des. Codes Cryptogr., 2014

Replication-based distributed storage systems with variable repetition degrees.
Proceedings of the Twentieth National Conference on Communications, 2014

The fundamental theorem of distributed storage systems revisited.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Regenerating codes over a binary cyclic code.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On low repair complexity storage codes via group divisible designs.
Proceedings of the IEEE Symposium on Computers and Communications, 2014

An energy-aware reliable deterministic broadcast protocol for wireless sensor networks.
Proceedings of the 2014 IEEE GLOBECOM Workshops, Austin, TX, USA, December 8-12, 2014, 2014

New MDS array code correcting multiple disk failures.
Proceedings of the IEEE Global Communications Conference, 2014

Repair efficient storage codes via combinatorial configurations.
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013
Cooperative Regenerating Codes.
IEEE Trans. Inf. Theory, 2013

Lattice Network Codes Based on Eisenstein Integers.
IEEE Trans. Commun., 2013

Optimized-Cost Repair in Multi-hop Distributed Storage Systems with Network Coding
CoRR, 2013

On the Optimum Cyclic Subcode Chains of (2, m)<sup>*</sup> for Increasing Message Length.
CoRR, 2013

Network Coding Theory: A Survey.
IEEE Commun. Surv. Tutorials, 2013

Multicast packing for coding across multiple unicasts.
Proceedings of the International Symposium on Network Coding, 2013

Combinatorial flow over cyclic linear networks.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Symmetry in distributed storage systems.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

BASIC regenerating code: Binary addition and shift for exact repair.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Repairing multiple failures in the Suh-Ramchandran regenerating codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Protocol sequences for mobile ad hoc networks.
Proceedings of IEEE International Conference on Communications, 2013

General self-repairing codes for distributed storage systems.
Proceedings of IEEE International Conference on Communications, 2013

Deterministic vs random access schemes - A case study in mobile ad hoc networks.
Proceedings of the 6th IEEE International Conference on Advanced Infocomm Technology, 2013

Construction of exact-BASIC codes for distributed storage systems at the MSR point.
Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012
Construction of Space/Wavelength/Time Spread Optical Code with Large Family Size.
IEEE Commun. Lett., 2012

Linear Network Code for Erasure Broadcast Channel with Feedback: Complexity and Algorithms
CoRR, 2012

Broadcasting with coded side information.
Proceedings of the 23rd IEEE International Symposium on Personal, 2012

Functional-repair-by-transfer regenerating codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Completely Irrepressible Sequences for the Asynchronous Collision Channel Without Feedback.
IEEE Trans. Veh. Technol., 2011

A Layered Decomposition Framework for Resource Allocation in Multiuser Communications.
IEEE Trans. Veh. Technol., 2011

Strongly Conflict-Avoiding Codes.
SIAM J. Discret. Math., 2011

Round-robin power control for the weighted sum rate maximisation of wireless networks over multiple interfering links.
Eur. Trans. Telecommun., 2011

On conflict-avoiding codes of weight three and odd length.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Generation of innovative and sparse encoding vectors for broadcast systems with feedback.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Cooperative Regenerating Codes for Distributed Storage Systems.
Proceedings of IEEE International Conference on Communications, 2011

Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration.
Proceedings of the Global Communications Conference, 2011

2010
A general upper bound on the size of constant-weight conflict-avoiding codes.
IEEE Trans. Inf. Theory, 2010

Construction and Applications of CRT Sequences.
IEEE Trans. Inf. Theory, 2010

Rate Allocation for Cooperative Orthogonal-Division Channels with Dirty-Paper Coding.
IEEE Trans. Commun., 2010

Joint Channel-Network Coding for the Gaussian Two-Way Two-Relay Network.
EURASIP J. Wirel. Commun. Netw., 2010

A tight asymptotic bound on the size of constant-weight conflict-avoiding codes.
Des. Codes Cryptogr., 2010

Information Flow in One-Dimensional Vehicular Ad Hoc Networks
CoRR, 2010

Resource Allocation for Wireless Multi-Carrier Network with Receiver Cooperation.
Proceedings of the 71st IEEE Vehicular Technology Conference, 2010

User-Irrepressible Sequences.
Proceedings of the Sequences and Their Applications - SETA 2010, 2010

User-detectable sequences for the collision channel without feedback.
Proceedings of the 2010 7th International Symposium on Wireless Communication Systems, 2010

Construction of short protocol sequences with worst-case throughput guarantee.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Shift-invariant protocol sequences for the collision channel without feedback.
IEEE Trans. Inf. Theory, 2009

Fair Resource Allocation for the Gaussian Broadcast Channel with ISI.
IEEE Trans. Commun., 2009

On pairwise shift-invariant protocol sequences.
IEEE Commun. Lett., 2009

Capacity region of the linear four-node half-duplex wireless relay network.
IEEE Commun. Lett., 2009

Achieving Capacity of Bi-Directional Tandem Collision Network by Joint Medium-Access Control and Channel-Network Coding
CoRR, 2009

A transmission scheme for wireless network with receiver cooperation.
Proceedings of the IEEE 20th International Symposium on Personal, 2009

A power control algorithm for the sum rate maximization of wireless networks.
Proceedings of the IEEE 20th International Symposium on Personal, 2009

Design and construction of protocol sequences: Shift invariance and user irrepressibility.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Sum Capacity of One-Sided Parallel Gaussian Interference Channels.
IEEE Trans. Inf. Theory, 2008

Transmitter cooperation by recycling dirty paper.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Convergence of Iterative Waterfilling Algorithm for Gaussian Interference Channels.
IEEE J. Sel. Areas Commun., 2007

Rate Allocation for Cooperative Transmission in Parallel Channels.
Proceedings of the Global Communications Conference, 2007

2006
Stability of distributed power and signature sequence control for CDMA Systems-a game-theoretic framework.
IEEE Trans. Inf. Theory, 2006

On the Fairness of Rate Allocation in Gaussian Multiple Access Channel and Broadcast Channel
CoRR, 2006

Fair Rate Allocation in Some Gaussian Multiaccess Channels.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Iterative Waterfilling for Parallel Gaussian Interference Channels.
Proceedings of IEEE International Conference on Communications, 2006

Opportunistic Power Control with Rate Adaptation for Video Conferencing Services.
Proceedings of IEEE International Conference on Communications, 2006

2004
On the zeta functions of two towers of function fields.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Expander graphs and codes.
Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002
Evaluation on the stability of discrete power control algorithms.
Proceedings of the 13th IEEE International Symposium on Personal, 2002

Permutation coding and MFSK modulation for frequency selective channel.
Proceedings of the 13th IEEE International Symposium on Personal, 2002

2001
Channel assignment and layer selection in hierarchical cellular system with fuzzy control.
IEEE Trans. Veh. Technol., 2001

A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound.
IEEE Trans. Inf. Theory, 2001

On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound.
IEEE Trans. Inf. Theory, 2001

1995
Fuzzy distributed power control in cellular radio network.
Proceedings of the 6th IEEE International Symposium on Personal, 1995


  Loading...