Title :
On efficient m-ary balanced codes
Author :
Tallini, L.G. ; Vaccaro, U.
Author_Institution :
Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
An m-ary balanced code is a code of length n over the alphabet Z m={0,1,…, m-1} such that each codeword is balanced; that is, the real sum of its components (or weight) is equal to [(m-1)n/2]. This paper contains new efficient methods to design m-ary balanced codes which improve the constructions found in the literature, for all alphabet size m⩾2. To design such codes, the information words which are close to be balanced are encoded using single maps defined by a new generalization of Knuth´s (1986) complementation method to the m-ary alphabet. Whereas, the remaining information words are compressed via some m-ary uniquely decodable variable length codes and then balanced using the saved space
Keywords :
decoding; variable length codes; alphabet; alphabet size; code design; code length; code weight; codeword; efficient m-ary balanced codes; efficient methods; generalised Knuth complementation method; information words; single maps; uniquely decodable variable length codes; Computer science; Decoding; Design methodology; Encoding; Tail;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613132
