Results 11 to 20 of about 3,122,392 (352)
, 2010 An investigation into history documentary production processes - How Britain Bridges the World - 60 minute documentary - The History Channel The documentary narrative and content was developed by Senior Lecturer Fiona Graham and explored the engineering
Title Role Productions, Manchester +2 more
core +6 more sources
Simulation of a Channel with Another Channel [PDF]
IEEE Transactions on Information Theory, 2016 31 pages, 10 figures, and some parts of this work were published at ITW ...
Farzin Haddadpour +4 more
openaire +3 more sources
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 Jr. +1 more
openaire +2 more sources
Essays on Channel Deletion and Channel Contraction [PDF]
, 2022 With the advent of online, mobile, and social media channels, firms have an array of channels in their channel mix. The proliferation of channels has increased marketing costs and may be detrimental to a firm’s competitive position.
Kumar, Binay
core +1 more source
Source–Channel Diversity for Parallel Channels [PDF]
IEEE Transactions on Information Theory, 2005 We consider transmitting a source across a pair of independent, non-ergodic channels with random states (e.g., slow fading channels) so as to minimize the average distortion. The general problem is unsolved. Hence, we focus on comparing two commonly used source and channel encoding systems which correspond to exploiting diversity either at the physical
J. Nicholas Laneman +3 more
openaire +4 more sources
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2009 Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-state semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Making use of results in finite blocklength channel coding,
Lav R. Varshney +2 more
openaire +4 more sources
The channel capacity of the postal channel
Information and Control, 1970 A mathematical model is proposed for a postal service which occasionally loses letters. A positive coding theorem and a converse is proved for this channel. The coding theorem is proved by utilizing a deterministic code (Reed-Solomon code) and bounded discrepancy decoding.
Jack K. Wolf, Aaron D. Wyner, Jacob Ziv
openaire +2 more sources
European Journal of Combinatorics, 2019 We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder. We also show that any metric, up to a decoding equivalence, can be isometrically embedded into the hypercube with the Hamming metric, and thus, in terms of decoding, the Hamming ...
Rafael Gregorio Lucas D'Oliveira +1 more
openaire +4 more sources
Clicking for friendship: social network sites and the medium of personhood
MedieKultur: Journal of Media and Communication Research, 2010 Social networking sites such as MySpace and Facebook depend on familiar social resources, including language, reading/writing and established semantic constructs such as personhood, privacy and friends. However, the use of computers, the Web 2.0 platform,
Daniel B. Lee +2 more
doaj +1 more source
The desensitization pathway of GABAA receptors, one subunit at a time
Nature Communications, 2020 GABAA receptors mediate most inhibitory synaptic transmission in the brain. Here authors used concatemeric α1β2γ2 GABAA receptors to introduce gain-of-desensitization mutations one subunit at a time, revealing non-concerted rearrangements with a key ...
Marc Gielen +2 more
doaj +1 more source