TY - GEN
T1 - Efficient balancing of q-ary sequences with parallel decoding
AU - Swart, Theo G.
AU - Weber, Jos H.
PY - 2009
Y1 - 2009
N2 - Balancing of q-ary sequences, using a generalization of Knuth's efficient parallel balancing scheme, is considered. It is shown that the new general scheme is as simple as the original binary scheme, which lends itself to parallel decoding of the balanced sequences.
AB - Balancing of q-ary sequences, using a generalization of Knuth's efficient parallel balancing scheme, is considered. It is shown that the new general scheme is as simple as the original binary scheme, which lends itself to parallel decoding of the balanced sequences.
UR - http://www.scopus.com/inward/record.url?scp=70449487095&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5205824
DO - 10.1109/ISIT.2009.5205824
M3 - Conference contribution
AN - SCOPUS:70449487095
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1564
EP - 1568
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -