This project aims at implementing Indexing for Web 2.0 Applications. Ajax applications consist of a set of states which are generated by the user through actions such as click, focus, blur etc. events. By saving these DOM states we can index information obtained from dynamically generated web content. To prevent...
A binary code of length n is called a balanced code if each codeword contains exactly ⌊n/2⌋ (or ⌈n/2⌉) ones and ⌈n/2⌉ (or ⌊n/2⌋) zeros. In this paper, we give two improved methods for encoding and decoding the balanced codes. The first one, called improved single map, improves the computation...
In this thesis, we propose a systematic code for correcting t = 1 insertion/deletion errors of the character ”0” that can occur between any two consecutive 1’s in a binary string. The code requires balanced input strings, where each word of length n contains ⌈n/2⌉ 0’s and ⌊n/2⌋ 1’s. This...