Wael Halbawi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wael Halbawi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Babak Hassibi
Department of Electrical Engineering, California Institute of Technology, Pasadena, CA 91125 USA
2 shared publications- Son Hoang Dau
RMIT University
2 shared publications - Babak Hassibi
Electrical Engineering Department, California Institute of Technology, Pasadena, CA, USA
1 shared publication Iwan Duursma
University of Illinois Urbana, Illinois 61801
1 shared publication- Iwan Duursma
University of Illinois at Urbana-Champaign, Urbana, USA
1 shared publication Iwan M. Duursma
Department of Mathematics, University of Illinois, Urbana, Illinois 61801 USA
1 shared publication
Latest Publications
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (1) , 118-130
Sparse and Balanced Reed–Solomon and Tamo–Barg Codes
We study the problem of constructing balanced generator matrices for Reed–Solomon and Tamo–Barg codes. More specifically, we are interested in realizing generator matrices, for the full-length cyclic versions of these codes, where all rows have the same weight and the difference in weight between any columns is at most one. The results presented in this paper translate to computationally balanced encoding schemes which can be appealing in distributed storage applications. Indeed, the balancedness of these generator matrices guarantees that the computation effort exerted by any storage node is essentially the same. In general, the framework presented can accommodate various values for the required row weight.We emphasize the possibility of constructing sparsest and balanced generator matrices for Reed–Solomon codes, i.e. each row is a minimum distance codeword. The number of storage nodes contacted once a message symbol is updated decreases with the row weight, so sparse constructions are appealing in that context. Results of similar flavor are presented for cyclic Tamo–Barg codes. In particular, we show that for a code with minimum distance d and locality r, a construction in which every row is of weight d + r – 1 is possible. The constructions presented are deterministic and operate over the codes’ original underlying finite field. As a result, efficient decoding from both errors and erasures is possible thanks to the plethora of efficient decoders available for the codes considered.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (1) , 118-130
Sparse and Balanced Reed–Solomon and Tamo–Barg Codes
We study the problem of constructing balanced generator matrices for Reed–Solomon and Tamo–Barg codes. More specifically, we are interested in realizing generator matrices, for the full-length cyclic versions of these codes, where all rows have the same weight and the difference in weight between any columns is at most one. The results presented in this paper translate to computationally balanced encoding schemes which can be appealing in distributed storage applications. Indeed, the balancedness of these generator matrices guarantees that the computation effort exerted by any storage node is essentially the same. In general, the framework presented can accommodate various values for the required row weight.We emphasize the possibility of constructing sparsest and balanced generator matrices for Reed–Solomon codes, i.e. each row is a minimum distance codeword. The number of storage nodes contacted once a message symbol is updated decreases with the row weight, so sparse constructions are appealing in that context. Results of similar flavor are presented for cyclic Tamo–Barg codes. In particular, we show that for a code with minimum distance d and locality r, a construction in which every row is of weight d + r – 1 is possible. The constructions presented are deterministic and operate over the codes’ original underlying finite field. As a result, efficient decoding from both errors and erasures is possible thanks to the plethora of efficient decoders available for the codes considered.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1018-1022
Balanced and sparse Tamo-Barg codes
We construct balanced and sparse generator matrices for Tamo and Barg's Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1018-1022
Balanced and sparse Tamo-Barg codes
We construct balanced and sparse generator matrices for Tamo and Barg's Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.
- 27 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 409-413
Balanced Reed-Solomon codes for all parameters
We construct balanced and sparsest generator matrices for cyclic Reed-Solomon codes with any length n and dimension k. By sparsest, we mean that each row has the least possible number of nonzeros, while balanced means that the number of nonzeros in any two columns differs by at most one. Codes allowing such encoding schemes are useful in distributed settings where computational load-balancing is critical. The problem was first studied by Dau et al. who showed, using probabilistic arguments, that there always exists an MDS code over a sufficiently large field such that its generator matrix is both sparsest and balanced. Motivated by the need for an explicit construction with efficient decoding, the authors of the current paper showed that the generator matrix of a cyclic Reed-Solomon code of length n and dimension k can always be transformed to one that is both sparsest and balanced, when n and k are such that k/n (n-k+1) is an integer. In this paper, we lift this condition and construct balanced and sparsest generator matrices for cyclic Reed-Solomon codes for any set of parameters.
- 27 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 409-413
Balanced Reed-Solomon codes for all parameters
We construct balanced and sparsest generator matrices for cyclic Reed-Solomon codes with any length n and dimension k. By sparsest, we mean that each row has the least possible number of nonzeros, while balanced means that the number of nonzeros in any two columns differs by at most one. Codes allowing such encoding schemes are useful in distributed settings where computational load-balancing is critical. The problem was first studied by Dau et al. who showed, using probabilistic arguments, that there always exists an MDS code over a sufficiently large field such that its generator matrix is both sparsest and balanced. Motivated by the need for an explicit construction with efficient decoding, the authors of the current paper showed that the generator matrix of a cyclic Reed-Solomon code of length n and dimension k can always be transformed to one that is both sparsest and balanced, when n and k are such that k/n (n-k+1) is an integer. In this paper, we lift this condition and construct balanced and sparsest generator matrices for cyclic Reed-Solomon codes for any set of parameters.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23749660,p. 1-6
Distributed gabidulin codes for multiple-source network error correction
We consider the problem of noncoherent error correction in multiple-source multicast networks. We show that a distributed network error-correcting code can be designed as a subcode of a Gabidulin code. This allows the destination nodes to utilize any decoder designed using rank-metric. We show that this achieves the full capacity region of any network with up to three messages, with optimal scaling in field size.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23749660,p. 1-6
Distributed gabidulin codes for multiple-source network error correction
We consider the problem of noncoherent error correction in multiple-source multicast networks. We show that a distributed network error-correcting code can be designed as a subcode of a Gabidulin code. This allows the destination nodes to utilize any decoder designed using rank-metric. We show that this achieves the full capacity region of any network with up to three messages, with optimal scaling in field size.