The present study deals with the investigations of the recursive versions o f well known code word lengths due to Campbell (1965) and Kapur (1988). It has been proved that the recursive codes for both the lengths are better than their original code from redundancy point of view and the comparison criterion is the average redundancy taken over the set of all n -tuple distributions. Furthermore, it is shown that when symbol probabilities are arranged in descending order, the recursive versions o f both the codes provide much better results. The methodology adopted for this recursive approach involves the use of programming through Matlab and Simulation techniques
展开▼
