The present invention relates to a method to generate a quaternary universal code about an arbitrary number (K = 1). As shown in the table below, the quaternary universal code has a top digit formed with 2 or 3 in a case of quaternary and has digits below formed with 0 or 1. For example, a quaternary universal code formed like 2/3/211/301/210/2000 is perfectly divided into a universal code satisfying a unique decodability if data is divided and read whenever meeting 2 or 3. The present invention includes: 1) a step of obtaining M from an arbitrary number K; 2) a step of obtaining a P value from the M; 3) a step of obtaining R with a formula like below to obtain a number existing after 2 or 3 of the top digit in the quaternary universal code from the P value; 4) a step of converting the R into a binary number formed with 0 and 1 by converting P into a binary number of P bit after obtaining the R, wherein the R has a length of P bit, and converting into a P bit by filling with 0 from the top bit as a leading zero when smaller than P bit; and 5) a step of arranging 2 when K is an odd number and arranging 3 when K is an even number at the top digit (of course, a reverse order can be assigned according to odd and even numbers, 2 and 3 can be assigned differently depending on the K value according to a specific promise, and thereby encryption becomes possible). A universal code is generated by a final number K by forming a quaternary universal code by arranging R binarized after 2 or 3 determined by the number K.;COPYRIGHT KIPO 2017
展开▼
