Steganographic coding is an essential part of adaptive steganography. There are only two
practical near-optimal codes in the context of adaptive steganography so far: Syndrome …

We present an efficient learning algorithm for the problem of training neural networks with
discrete synapses, a well-known hard (NP-complete) discrete optimization problem. The …

In the Internet of Things, sensor nodes collect environmental information and utilize lossy
compression for saving storage space. To achieve this objective, high-efficiency …

The low-density parity-check (LDPC) code has been employed for the lossy compression of
the binary symmetric source (BSS). However, the BSS application is limited in digital signal …

It is challenging to design an efficient lossy compression scheme for complicated sources
based on block codes, especially to approach the theoretical distortion-rate limit. In this …

We consider a high-dimensional random constrained optimization problem in which a set of
binary variables is subjected to a linear system of equations. The cost function is a simple …

In this paper, a new variable length coding scheme using a low density parity check (LDPC)
code is proposed for the lossy compression of general iid finite sources. It is proved that the …

This paper focus on the lossy compression of a binary symmetric source. We propose a new
algorithm for binary quantization over low density generator matrix (LDGM) codes. The …

This paper presents a low complexity lossy compression algorithm with protograph LDPC
codes (Lossy P-LDPC Codes) over GF (2), for binary symmetric sources. The proposed …

This paper researches channel coding for satellite communications. Fountain codes and
Non-binary LDPC codes are introduced, including their encoding and decoding algorithm …