Results 1 to 10 of about 161,906 (111)
Channel coding: The road to channel capacity [PDF]
Proceedings of the IEEE, 2007 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.
Daniel J Costello, G David Forney
exaly +3 more sources
IEEE Transactions on Information Theory, 2023 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 0001
openaire +2 more sources
Codes for channels with segmented edits [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 We consider 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. We further assume that there are no segment markers in the received sequence. We propose code constructions for the segmented deletion, segmented insertion,
Abroshan, M +2 more
openaire +5 more sources
Polar Codes for Broadcast Channels [PDF]
IEEE Transactions on Information Theory, 2013 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 +2 more sources
Channel coding for satellite mobile channels [PDF]
International Journal of Satellite Communications, 1989 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 +1 more source
Codes for DNA storage channels [PDF]
2015 IEEE Information Theory Workshop (ITW), 2015 32 pages, 5 ...
Han Mao Kiah +2 more
openaire +2 more sources
Coding for the fading channel: a survey [PDF]
Signal Processing, 2000 We consider the design of coding schemes for a channel affected by flat, slow fading and additive noise. Specifically, by using the ``block-fading'' channel model, we allow delay constraints to be taken into account. Optimum coding schemes for this channel model lead to the development of new criteria for code design, differing markedly from the ...
BIGLIERI E., CAIRE G., TARICCO, GIORGIO
openaire +3 more sources
Duality of channels and codes [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 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 +2 more sources
Channel Detection in Coded Communication [PDF]
IEEE Transactions on Information Theory, 2017 We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the prevailing channel. We begin with the simplified case where each of the sets is
Nir Weinberger, Neri Merhav
openaire +3 more sources
Polar coding for fading channels [PDF]
2013 IEEE Information Theory Workshop (ITW), 2013 A polar coding scheme for fading channels is proposed in this paper. More specifically, the focus is Gaussian fading channel with a BPSK modulation technique, where the equivalent channel could be modeled as a binary symmetric channel with varying cross-over probabilities.
Hongbo Si +2 more
openaire +2 more sources