This paper proposes a Tibetan text compression algorithm (TiCA), which is based on the fact that each Tibetan syllable is composed of one to seven components and each component has a unique Unicode encoding. First of all, through statistical analysis of 20G Tibetan text corpus, a fault-tolerant mapping dictionary is established and used as the dictionary of the TiCA. The TiCA then compresses the Tibetan text according to the mapping dictionary by mapping the original code to a single code. Finally, the experimental comparison shows that the Tibetan text compression algorithm proposed in this paper has achieved excellent results both in the compression rate and time consuming.