Sparse graph-based codes such as low-density parity-check (LDPC) codes have revolutionized coding theory and have been proposed for many emerging communication and storage systems due to their excellent performance. A substantial amount of research has been devoted to the study of binary LDPC codes. In contrast, non-binary LDPC codes had been deemed too complex and consequently have not been st...

This paper describes the application of a partial order constraint solver to a telecommunications feature subscription configuration problem. Partial order constraints are encoded to propositional logic and solved using a state-of-the-art Boolean satisfaction solver. The encoding is based on a symbol-based approach: symbols are viewed as variables which take integer values and are interpreted a...

Due to the advantages of high information densities and longevity, DNA storage systems have begun attract a lot attention. However, common obstacles are caused by insertion, deletion, substitution errors occurring in synthesis sequencing. In this paper, we first explain method convert binary data into general maximum run-length $r$ sequences with specific length construction, which can be used ...

Adaptive Binary Arithmetic coding is an effective mode of coding. In this paper we propose an efficient adaptive binary arithmetic coder, which is multiplication-free and look-up table free. To achieve this, we combine the probability estimation based on the virtual sliding window technique with the approximation of multiplication and the use of simple operations to calculate the next approxima...

It has been claimed that connectionist methods of encoding compositional structures, such as Pollack's RAAM, support a non-classical form of structure sensitive operation known as holistic computation, where symbol structures can be acted upon holistically without the need to decompose them, or to perform a search to locate or access their constituents. In this paper, it is argued that the conc...

Set Partitioning in Hierarchical Trees (SPIHT) is a wavelet based compression algorithm that offers good compression ratios, a fully progressive bit-stream, and good image quality. This paper presents the results of adding arithmetic compression to the SPIHT images in the hopes of further reducing the image size. Both the original SPIHT algorithm and a version optimized for FPGAs were used. Our...

In this paper we propose a novel efficient adaptive binary arithmetic coder which is multiplication-free and requires no look-up tables. To achieve this, we combine the probability estimation based on a virtual sliding window with the approximation of multiplication and the use of simple operations to calculate the next approximation after the encoding of each binary symbol. We show that in com...

The metal deficient (Z = Z⊙/41) Blue Compact Dwarf Galaxy (BCD) SBS0335-052 was observed with ISOCAM between 5 and 17μm. With a L12μm/LB ratio of 2.15, the galaxy is unexpectedly bright in the mid-infrared for such a low-metallicity object. The mid-infrared spectrum shows no sign of the Unidentified Infrared Bands, which we interpret as an effect of the destruction of their carriers by the very...

In a frequency-selective fading channel, the transmission performance of single-carrier (SC) transmission significantly degrades due to severe inter-symbol-interference (ISI). In this paper, the joint use of space-time transmit diversity (STTD), receive antenna diversity and frequency-domain minimum mean square error (MMSE) equalization in SC transmission is studied. Space-time encoding and dec...

Tree codes are introduced in [4]. As examples, the encoding principles of two different tree codes are shown in Fig. 1 using Bayesian networks. Here, every node represents a bit in the code, distinguished by a white one (such as dk,0) for an information bit and a black one (such as qk ) for a parity bit. The latter is the parity check of the starting nodes of its incoming edges. Denote the kth ...