Results 251 to 260 of about 187,896 (301)

Case report: Whole-exome sequencing reveals a novel variant in a patient with epilepsy presenting with fever. [PDF]

Front Genet
Guo W, Song D, Cheng K, Wang C, Wang Y, Yang X, Lin Y, Jiang X, Liu X, Lan L.   +9 more
europepmc   +1 more source

Extended Arimoto-Blahut Algorithms for Bistatic Integrated Sensing and Communications Systems. [PDF]

Entropy (Basel)
Jiao T, Geng Y, Wei Z, Yang Z.
europepmc   +1 more source

A Survey of Lattice-Based Physical-Layer Security for Wireless Systems with <i>p</i>-Modular Lattice Constructions. [PDF]

Entropy (Basel)
Khodaiemehr H, Bagheri K, Mohajer A, Feng C, Panario D, Leung VCM.   +5 more
europepmc   +1 more source

On performance evaluation of NOMA-aided SIMO multi-hop schemes using energy harvesting and fountain coding based information accumulation. [PDF]

PLoS One
An NH, Tu LT, Duy TT, Nguyen TT.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Arithmetic Codes for Constrained Channels

IBM Journal of Research and Development, 1983
Arithmetic codes have been studied in the context of compression coding, i.e., transformations to code strings which take up less storage space or require less transmission time over a communications link. Another application of coding theory is that of noiseless channel coding, where constraints on strings in the channel symbol alphabet prevent an ...
G. Nigel Martin, Glen G. Langdon Jr., Stephen Todd   +2 more
openaire   +2 more sources

From channel codes to computation codes

2012 IEEE Information Theory Workshop, 2012
In this paper, it is shown that a computation code exists for a stationary and d-continuous noisy computation if a channel code exists for the “virtual” channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient
openaire   +1 more source

Codes Over Absorption Channels

IEEE Transactions on Information Theory
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zuo Ye, Wenjun Yu, Ohad Elishco
openaire   +1 more source

A General Method for Channel Coding

IBM Journal of Research and Development, 1980
A procedure is described for constructing minimum delay codes for discrete noiseless channels. The method is based on a simple recursive algorithm for finding a set of coding paths.
openaire   +1 more source

Coding for noisy channels

1990
Reliable communication over a noisy channel is the focus of this chapter. The chapter begins with a development of the classic fundamental results of Feinstein regarding reliable communication of block codes and the relation of operational channel capacity to Shannon capacity for discrete channels. A technique of Dobrushin is used to extend Feinstein’s
openaire   +1 more source