In this paper, we propose a packet-interleaving scheme (PIS) for increasing packet reliability under burst errors in wireless sensor networks (WSN). In a WSN, packet errors could occur due to weak signal strength or interference. These erroneous packets have to be retransmitted, which will increase network load substantially. The proposed PIS, encoding data using Reed-Solomon (RS) codes, can cl...

Compressors based on the Burrows Wheeler transform (BWT) convert the transformed text into a string of (move-to-front) ranks. These ranks are then encoded with an Ordermodel, or a hierarchy of such models. Although these rank-based methods perform very well, we believe the transformation to MTF numbers blurs the distinction between individual symbols and is a possible cause of inefficiency. Ins...

Recent work in neural machine translation has shown promising performance, but the most effective architectures do not scale naturally to large vocabulary sizes. We propose and compare three variable-length encoding schemes that represent a large vocabulary corpus using a much smaller vocabulary with no loss in information. Common words are unaffected by our encoding, but rare words are encoded...

Shannon's capacity formula for memoryless and finite-state noiseless channels is proved in a simple elementary way, for arbitrary symbol costs; actually, a somewhat stronger result is proved. Further, a simple proof of a version of the noiseless coding theorem is given, based on the properties of entropy and avoiding combinatorial arguments; also, in the familiar proof of the mentioned theorem,...

A simple serially concatenated turbo code using differential 8PSK encoding as the inner code and a [3,2,2] parity code as the outer code is studied. This system is decoded coherently according to turbo principles with iterative exchange of extrinsic probabilities. Decoding over channels without prior synchronization is demonstrated to be feasible even with significant phase offset, using a simp...

We investigate the recursive structure of differentiable sequences over the alphabet {1, 2}. We derive a recursive formula for the (n + 1)-th symbol of a differentiable sequence, which yields to a new recursive formula for the Kolakoski sequence. Finally, we show that the sequence of absolute differences of consecutive symbols of a differentiable sequence u is a morphic image of the run-length ...