Results 221 to 230 of about 1,926,748 (272)

Behavioral engagement and stimulus regularities coordinate auditory-prefrontal network activity. [PDF]

PLoS Biol
Xu H, Song P, Ye H, Lao-Rodríguez AB, Zhang Q, Zhai Y, Bao X, Mehmood I, Tanigawa H, Tu Z, Zhang L, Zhao X, Pérez-González D, Malmierca MS, Yu X.   +14 more
europepmc   +1 more source

An end-to-end deep learning image compression method for satellite images based on entropy model. [PDF]

PLoS One
Gao Y, Xu H, Huang W, Bai H, Peng B, Xu H.   +5 more
europepmc   +1 more source

Space-time-coding metasurfaces for high-dimensional communications with OAM-, polarization-, and frequency-division multiplexing. [PDF]

Light Sci Appl
Zhang L, Cui TJ.
europepmc   +1 more source

Bright monomeric fluorescent protein elite-niRFP704 for two-channel near-infrared STED nanoscopy. [PDF]

Proc Natl Acad Sci U S A
Habenstein F, Jensen N, Stumpf D, Chizhik AI, Leutenegger M, Chang J, Fognini A, Qin-Dregely J, Zadeh IE, Kirck LL, Enderlein J, Inamdar K, Hell SW, Jakobs S.   +13 more
europepmc   +1 more source

Secure image exchange over cloud networks with neural key exchange protocol. [PDF]

Sci Rep
Alexan W, Megalli Y, Malak M, Khaled S, Mashaly M.   +4 more
europepmc   +1 more source

Gain-adaptive STAR-RIS assisted vehicular NOMA with transmit antenna selection. [PDF]

Sci Rep
Ibraheem SM, Shokair M, Nasr ME, Alshaer N.   +3 more
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   +2 more sources

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

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   +2 more sources