Abstract: A fault-tolerant node for synchronous heterogeneous database replication and a method for performing a synchronous heterogenous database replication at such a node are provided. A processor executes a computer program to generate a series of database transactions to be carried out at the fault-tolerant node. The fault-tolerant node comprises at least two relational database management systems, each of which are different relational database management system products, each implementing snapshot isolation between concurrent transactions. Each system comprises a database and a database management component. For each database transaction, operation instructions are provided concurrently to each of the systems to carry out operations on their respective databases and to provide respective responses. The responses generated by the systems either comprise an operation result or an exception.

Abstract: A fault-tolerant node for synchronous heterogeneous database replication and a method for performing a synchronous heterogenous database replication at such a node are provided. A processor executes a computer program to generate a series of database transactions to be carried out at the fault-tolerant node. The fault-tolerant node comprises at least two relational database management systems, each of which are different relational database management system products, each implementing snapshot isolation between concurrent transactions. Each system comprises a database and a database management component. For each database transaction, operation instructions are provided concurrently to each of the systems to carry out operations on their respective databases and to provide respective responses. The responses generated by the systems either comprise an operation result or an exception.

Abstract: A method for the Costa problem includes turbo-like nested code. In one embodiment, the method includes providing a turbo-like trellis-coded quantization for source coding. The method also includes providing a turbo trellis-coded modulation for channel coding.

Abstract: System and method for designing Slepian-Wolf codes by channel code partitioning. A generator matrix may be partitioned to generate a plurality of sub-matrices corresponding respectively to a plurality of correlated data sources. The partitioning may be performed in accordance with a rate allocation among the plurality of correlated data sources. A corresponding plurality of parity matrices may then be generated based respectively on the sub-matrices, where each parity matrix is useable to encode correlated data for a respective correlated data source.

Abstract: System and method for Slepian-Wolf coding using channel code partitioning. A generator matrix is partitioned to generate multiple sub-matrices corresponding respectively to multiple correlated data sources. The partitioning is in accordance with a rate allocation among the correlated data sources. Corresponding parity matrices may be generated respectively from the sub-matrices, where each parity matrix is useable to encode correlated data for a respective correlated data source, resulting in respective syndromes, e.g., in the form of binary vectors. A common receiver may receive the syndromes and expand them to a common length by inserting zeros appropriately. The expanded syndromes may be vector summed (e.g., modulo 2), and a single channel decoding applied to determine a closest codeword, portions of whose systematic part may be multiplied by respective submatrices of the generator matrix, which products may be added to the respective expanded syndromes to produce estimates of the source data.