Related papers: Enhanced blind decoding of Tardos codes with new m…
To hide a binary pattern in the palette image a steganographic scheme with blind detection is considered. The embedding algorithm uses the Lehmer code by palette color permutations for which the cover image palette is generally required.…
Digital Audio Broadcasting (DAB)-like systems employ differentially encoded (DE) phase-shift keying (PSK) for transmission. While turbo-DE-PSK receivers offer substantial performance gains through iterative decoding by making the DE-PSK an…
In this paper we present a new Turbo analog error correcting coding scheme for real valued signals that are corrupted by impulsive noise. This Turbo code improves Donoho's deterministic construction by using a probabilistic approach. More…
This paper investigates decoding of binary linear block codes over the binary erasure channel (BEC). Of the current iterative decoding algorithms on this channel, we review the Recovery Algorithm and the Guess Algorithm. We then present a…
Modern program verifiers use logic-based encodings of the verification problem that are discharged by a back end reasoning engine. However, instances of such encodings for large programs can quickly overwhelm these back end solvers. Hence,…
We introduce a novel algorithm for decoding binary linear codes by linear programming. We build on the LP decoding algorithm of Feldman et al. and introduce a post-processing step that solves a second linear program that reweights the…
A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send different confidential (and non-confidential) information to…
In this paper, we introduce a deep learning-based decoder designed for concatenated coding schemes over a deletion/substitution channel. Specifically, we focus on serially concatenated codes, where the outer code is either a convolutional…
We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform…
The practical implementation of maximum likelihood detection is limited by its high complexity as well as requiring perfect channel state information. Although conventional blind detection techniques reduce complexity, they degrade…
This paper studies fingerprinting (traitor tracing) games in which the number of colluders and the collusion channel are unknown. The fingerprints are embedded into host sequences representing signals to be protected and provide the…
We study the multi-user Bayesian persuasion game between one encoder and two decoders, where the first decoder is better informed than the second decoder. We consider two perfect links, one to the first decoder only, and the other to both…
Generalized Tanner graphs have been implicitly studied by a number of authors under the rubric of generalized parity-check matrices. This work considers the conditioning of binary hidden variables in such models in order to break all cycles…
We consider the massive MIMO downlink with time-division duplex (TDD) operation and conjugate beamforming transmission. To reliably decode the desired signals, the users need to know the effective channel gain. In this paper, we propose a…
Contracts specifying a procedure's behavior in terms of pre- and postconditions are essential for scalable software verification, but cannot express any constraints on the events occurring during execution of the procedure. This…
Turbo codes are a very efficient method for communicating reliably through a noisy channel. There is no theoretical understanding of their effectiveness. In [1] they are mapped onto a class of disordered spin models. The analytical…
Matched decoding is a technique that enables the efficient maximum-likelihood sequence estimation of convolutionally encoded PAM-transmission over ISI-channels. Recently, we have shown that the super-trellis of encoder and channel can be…
Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical…
In this paper, we analyze the delay probability of the first error position in perturbation-enhanced Successive cancellation (SC) decoding for polar codes. Our findings reveal that, asymptotically, an SC decoder's performance does not…
This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis…