Efficient connected-index finite-length arithmetic codes

In this paper, we propose a connected-index approach to construct efficient finite-length arithmetic codes by splitting the information of the last no nfitting symbol into the current and subsequent codewords. The proposed ari thmetic codes, which limit the error propagation in about one block, requir e neither a post-appended end of-block symbol, nor pre-affixed side-informa tion, to characterize the number of encoded symbols. Hence, the proposed fi nite-length arithmetic codes can nearly achieve the coding efficiency attai ned by infinite-length arithmetic codes. With high coding efficiency, limit ed error-propagation, and the regular process, the proposed coding approach is suitable for information exchange with small packets in modern high-spe ed network systems.