Efficient balancing of q-ary sequences with parallel decoding

Authors:
Theo G. Swart;Jos H. Weber
Affiliations:
Dept. of Electrical and Electronic Engineering Science, University of Johannesburg, South Africa;Delft University of Technology, IRCTR/CWPC, CD Delft, The Netherlands
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 9
Cited 0

Efficient balanced codes

IEEE Transactions on Information Theory
Balancing sets of vectors

IEEE Transactions on Information Theory
Efficient q-ary immutable codes

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Efficient m-ary balanced codes

Discrete Applied Mathematics
Balanced Codes with Parallel Encoding and Decoding

IEEE Transactions on Computers
Design of Efficient Balanced Codes

IEEE Transactions on Computers
Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation

IEEE Transactions on Computers
Design of some new efficient balanced codes

IEEE Transactions on Information Theory
On efficient balanced codes over the mth roots of unity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.