A general multi-terminal source code and a general multi-terminal channel code are presented. Constrainedrandom-number generators with sparse matrices, are used in the construction of both encoders and decoders. Achievable regions for source coding and channel coding are derived in terms of entropy functions, where the capacity region for channel coding provides an alternative to the region of ...

The ChEMBL database was mined to efficiently assemble an ion channel-focused screening library. The compiled library consists of 3241 compounds representing 123 templates across nine ion channel categories. Compounds in the screening library are annotated with their respective ion channel category to facilitate back-tracing of prospective molecular targets from phenotypic screening results. The...

Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on the effective rate-distortion function of LDGM codes for the binary symmetric source, showing that they quickly approach the rate-distortion function as the degree increases. We also compare and contrast the standard LDGM constr...

In [13] we proposed a (ρr, ρw)-adversarial wiretap channel model (AWTP) in which the adversary can adaptively choose to see a fraction ρr of the codeword sent over the channel, and modify a fraction ρw of the codeword by adding arbitrary noise values to them. In this paper we give the first efficient construction of a capacity achieving code family that provides perfect secrecy for this channel.

Turbo equalization is an iterative equalization and decoding technique that can achieve impressive performance gains for communication systems. In this letter, we investigate the turbo equalization method for the decoding of the Davey-MacKay (DM) construction over the IDSAWGN channels, which indicates a cascaded insertion, deletion, substitution (IDS) channel and an additive white Gaussian nois...

We study some structural properties of Construction-A lattices obtained from low density parity check (LDPC) codes over prime fields. Such lattices are called low density Construction-A (LDA) lattices, and permit low-complexity belief propagation decoding for transmission over Gaussian channels. It has been shown that LDA lattices achieve the capacity of the power constrained additive white Gau...

Motivated by the wide adoption of authenticated encryption and TLS, we suggest a basic channel abstraction, an augmented secure channel (ASC), that allows a sender to send a receiver messages consisting of two parts, where one is privacy-protected and both are authenticity-protected. Working in the tradition of constructive cryptography, we formalize this idea and provide a construction of this...

We derive a random-coding upper bound on the average probability of error of joint source-channel coding that recovers Csiszár’s error exponent when used with product distributions over the channel inputs. Our proof technique for the error probability analysis employs a code construction for which source messages are assigned to subsets and codewords are generated with a distribution that depen...