TY - GEN
T1 - Optimal binary switch codes with small query size
AU - Wang, Zhiying
AU - Kiah, Han Mao
AU - Cassuto, Yuval
N1 - Publisher Copyright: © 2015 IEEE.
PY - 2015/9/28
Y1 - 2015/9/28
N2 - In this paper, we study a construction of binary switch codes. A switch code is a code such that a multi-set request of information symbols can be simultaneously recovered from disjoint sets of codeword symbols. Our construction is optimal in the sense that it has the smallest codeword length given its average encoding degree, which is logarithmic in the code dimension. Moreover, the number of queries needed to recover any information symbol in the request is at most 2. As a result, our construction is the first family of switch codes with low encoding and decoding complexity.
AB - In this paper, we study a construction of binary switch codes. A switch code is a code such that a multi-set request of information symbols can be simultaneously recovered from disjoint sets of codeword symbols. Our construction is optimal in the sense that it has the smallest codeword length given its average encoding degree, which is logarithmic in the code dimension. Moreover, the number of queries needed to recover any information symbol in the request is at most 2. As a result, our construction is the first family of switch codes with low encoding and decoding complexity.
UR - https://www.scopus.com/pages/publications/84969753249
U2 - 10.1109/ISIT.2015.7282532
DO - 10.1109/ISIT.2015.7282532
M3 - Conference contribution
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 636
EP - 640
BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
T2 - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Y2 - 14 June 2015 through 19 June 2015
ER -