Results 11 to 20 of about 161,015 (210)
Channel capacities for list codes [PDF]
In the present paper we demonstrate that the concept of a list code is from a mathematical point of view a more canonical notion than the classical code concept (list size one) in that it allows a unified treatment of various coding problems. In particular we determine for small list sizes the capacities of arbitrarily varying channels.
Rudolf Ahlswede
openalex +5 more sources
On the Coding Theorem for the Noiseless Channel [PDF]
Patrick Billingsley
openalex +4 more sources
This paper is a collection of results on combinatorial properties of codes for the Z-channel. A Z-channel with error fraction $τ$ takes as input a length-$n$ binary codeword and injects in an adversarial manner up to $nτ$ asymmetric errors, i.e., errors that only zero out bits but do not flip $0$'s to $1$'s.
Nikita Polyanskii, Yihan Zhang
openaire +2 more sources
On Codes for the Noisy Substring Channel [PDF]
Author submitted, peer-reviewed ...
Yonatan Yehezkeally, Nikita Polyanskii
openaire +3 more sources
Channel coding: The road to channel capacity [PDF]
Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to capacity-approaching codes. We focus on the contributions that have led to the most significant improvements in performance vs.
G.D. Forney, D.J. Costello
openaire +3 more sources
Coding for Segmented Edit Channels [PDF]
This paper considers insertion and deletion channels with the additional assumption that the channel input sequence is implicitly divided into segments such that at most one edit can occur within a segment. No segment markers are available in the received sequence.
Mahed Abroshan+2 more
openaire +4 more sources
Channel coding for satellite mobile channels [PDF]
AbstractThe deployment of channel coding and interleaving to enhance the bit‐error performance of a satellite mobile radio channel is addressed for speech and data transmissions. Different convolutional codes (CC) using Viterbi decoding with soft decision are examined with inter‐block interleaving.
Wong, K H H, Hanzo, L, Steele, R
openaire +3 more sources
Polar Codes for Broadcast Channels [PDF]
Polar codes are introduced for discrete memoryless broadcast channels. For $m$-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from $m$ independent messages to one codeword while satisfying broadcast constraints.
Naveen Goela+2 more
openaire +4 more sources
Duality of channels and codes [PDF]
For any given channel $W$ with classical inputs and possibly quantum outputs, a dual classical-input channel $W^\perp$ can be defined by embedding the original into a channel $\mathcal N$ with quantum inputs and outputs. Here we give new uncertainty relations for a general class of entropies that lead to very close relationships between the original ...
openaire +4 more sources
Nash Codes for Noisy Channels [PDF]
This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed receiver, who communicate over a noisy channel. The sender’s strategy, called a code, maps states of nature to signals.
Hernández, Penélope+1 more
openaire +6 more sources