TY - GEN
T1 - Channel resolvability codes based on concatenation and sparse linear encoding
AU - Amjad, Rana Ali
AU - Kramer, Gerhard
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/9/28
Y1 - 2015/9/28
N2 - A concatenation of two encoders is used to construct channel resolvability codes. The code of the first encoder has large minimum distance and the second encoder is linear and has a sparse generator matrix. If the first encoder has encoding complexity O(n) or O(n log n), where n is the length of the codewords, an overall encoding complexity O(n log n) can be achieved. One can tune the sparsity to trade off the complexity of the second encoder against the minimum distance requirement of the first code, and to trade off the complexity of one of the encoders and the informational divergence scaling.
AB - A concatenation of two encoders is used to construct channel resolvability codes. The code of the first encoder has large minimum distance and the second encoder is linear and has a sparse generator matrix. If the first encoder has encoding complexity O(n) or O(n log n), where n is the length of the codewords, an overall encoding complexity O(n log n) can be achieved. One can tune the sparsity to trade off the complexity of the second encoder against the minimum distance requirement of the first code, and to trade off the complexity of one of the encoders and the informational divergence scaling.
UR - http://www.scopus.com/inward/record.url?scp=84969872793&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2015.7282828
DO - 10.1109/ISIT.2015.7282828
M3 - Conference contribution
AN - SCOPUS:84969872793
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2111
EP - 2115
BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Symposium on Information Theory, ISIT 2015
Y2 - 14 June 2015 through 19 June 2015
ER -