The Optimal Arrangement of Tibetan Character onto Keyboard

Arranging Tibetan on a keyboard is a crucial step to input Tibetan code.The better way to resolve the problem of Tibetan component more than available key is merging more components onto one key,but will bring out repeated code.In this paper we use the optimal design method based on graph theory and probability to arrive the maximum independent sets of coding components,and to reduce repetition of codes to absolute minimum.The algorithm to find maximum independent sets of Tibetan coding component and method extracting contradictory coding components are presented in the paper.Then complying with the principles of engineering psychology we have arranged 169 Tibetan characters onto standard keyboard.Not only could easily input Tibetan character efficiently,but also could input Tibetanized Sanskrit.