METHOD FOR ENCODING AND DECODING BINARY UNIVERSAL CODE TO N NUMBER SYSTEM UNIVERSAL CODE

摘要

The present invention relates to a method for generating quaternary universal code for a random order (K = 1), and as shown in a table, in case of quaternary, the top place is ″2″ or ″3″, and places below the top is ″0″ or ″1″. For example, in a case of quaternary universal code like 2/3/211/301/210/2000, data is read by separating data when a digit of ″2″ or ″3″ is encountered, such that the data is completely separated as a universal code satisfying unique decodability. The method is as follows: 1) calculate M from a random order K; 2) next, calculate P from M; 3) calculate R by a formula, M = [K/(n-2) + 1] wherein [x] returns a minimum integer of x or more, for calculating a digit existing after ″2″ or ″3″ in the top place from P in the quaternary universal code; 4) When R is calculated, convert R into binary digit configuring ″0″ and ″1″ in P bits, and R has a length of P bits and if R is smaller than P bits, fill ″0″ as a leading zero from the top bit to make P bits; and 5) When K is odd, ″2″ is in the top place, and when K is even, ″3″ is in the top place (of course, according to odd and even numbers, the digits can be allocated reversely, and according to specific promises, 2 and 3 can be allocated depending on K (accordingly, encryption is possible)), and place binary R after ″2″ or ″3″ determined by an order of K to configure quaternary universal code, and generate a universal code according to the final order of K.;COPYRIGHT KIPO 2018