Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Canal sin memoria")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 392

  • Page / 16
Export

Selection :

  • and

Secret sharing model : GS3LIN, P.-L; DUNHAM, J. G.Electronics Letters. 1994, Vol 30, Num 25, pp 2116-2118, issn 0013-5194Article

Dependence balance bounds for single-output two-way channelsHEKSTRA, A. P; WILLEMS, F. M. J.IEEE transactions on information theory. 1989, Vol 35, Num 1, pp 44-53, issn 0018-9448, 10 p.Conference Paper

On a coding theorem connected with useful entropy of order α and type βPRITI JAIN; TUTEJA, R. K.Kybernetika. 1987, Vol 23, Num 5, pp 420-427, issn 0023-5954Article

Capacity per unit cost of a discrete memoryless channelABDEL-GHAFFAR, K. A. S.Electronics Letters. 1993, Vol 29, Num 2, pp 142-144, issn 0013-5194Article

On the Equivalence of Two Achievable Regions for the Broadcast ChannelYINGBIN LIANG; KRAMER, Gerhard; VINCENT POOR, H et al.IEEE transactions on information theory. 2011, Vol 57, Num 1, pp 95-100, issn 0018-9448, 6 p.Article

Choosing the parameters of multiple-repetition strategiesVEUGEN, Thijs.European transactions on telecommunications. 2007, Vol 18, Num 3, pp 245-252, issn 1124-318X, 8 p.Article

On capacity of line networksNIESEN, Urs; FRAGOULI, Christina; TUNINETTI, Daniela et al.IEEE transactions on information theory. 2007, Vol 53, Num 11, pp 4039-4058, issn 0018-9448, 20 p.Article

Density evolution, thresholds and the stability condition for non-binary LDPC codes : Capacity approaching codes design and implementationRATHI, V; URBANKE, R.IEE proceedings. Communications. 2005, Vol 152, Num 6, pp 1069-1074, issn 1350-2425, 6 p.Article

A decoding algorithm for the (23, 12, 7) Golay code with error and erasure correctionELIA, M; TARICCO, G.Annales des télécommunications. 1995, Vol 50, Num 9-10, pp 721-731, issn 0003-4347Article

Optimal quantizer design for noisy channels: an approach to combined source-channel codingNARIMAN FARVARDIN; VINAY VAISHAMPAYAN.IEEE transactions on information theory. 1987, Vol 33, Num 6, pp 827-838, issn 0018-9448Article

How to Filter an Individual Sequence With FeedbackWEISSMAN, Tsachy.IEEE transactions on information theory. 2008, Vol 54, Num 8, pp 3831-3841, issn 0018-9448, 11 p.Article

On the capacity of a cascade of channelsKIELY, A. B; COFFEY, J. T.IEEE transactions on information theory. 1993, Vol 39, Num 4, pp 1310-1321, issn 0018-9448Article

An iterative method for computing the performance of discrete memoryless communication channelsBRIJPAUL, K; BHU DEV SHARMA.Information sciences. 1992, Vol 61, Num 1-2, pp 163-178, issn 0020-0255Article

Comment on Performance of single access classes on the IEEE 8024 token busJAYASUMANA, A. P.IEEE transactions on communications. 1988, Vol 36, Num 2, pp 224-225, issn 0090-6778Article

An upper bound on the cutoff rate of sequential decodingARIKAN, E.IEEE transactions on information theory. 1988, Vol 34, Num 1, pp 55-63, issn 0018-9448Article

A list-type reduced-constraint generalized of the Viterbi algorithmHASHIMOTO, T.IEEE transactions on information theory. 1987, Vol 33, Num 6, pp 866-876, issn 0018-9448Article

Alphabet-oriented and user-oriented source coding theoriesVAJDA, I.Kybernetika. 1987, Vol 23, Num 5, pp 388-406, issn 0023-5954Article

Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference ChannelsFANGFANG ZHU; BIAO CHEN.IEEE transactions on information theory. 2014, Vol 60, Num 7, pp 3763-3772, issn 0018-9448, 10 p.Conference Paper

Capacity Bounds and Exact Results for the Cognitive Z-Interference ChannelNAN LIU; MARIC, Ivana; GOLDSMITH, Andrea J et al.IEEE transactions on information theory. 2013, Vol 59, Num 2, pp 886-893, issn 0018-9448, 8 p.Article

An outer bound to the capacity region of the broadcast channelNAIR, Chandra; EL GAMAL, Abbas.IEEE transactions on information theory. 2007, Vol 53, Num 1, pp 350-355, issn 0018-9448, 6 p.Article

Bounds on information combining for parity-check equationsLAND, Ingmar; HOEHER, Peter A; HUBER, Johannes et al.International Zurich Seminar on Communications. 2004, pp 68-71, isbn 0-7803-8329-X, 1Vol, 4 p.Conference Paper

Extremal Channels of Gallager's E0 Under the Basic Polarization TransformationsALSAN, Mine.IEEE transactions on information theory. 2014, Vol 60, Num 3, pp 1582-1591, issn 0018-9448, 10 p.Conference Paper

Error Exponents for the Gaussian Channel With Active Noisy FeedbackKIM, Young-Han; LAPIDOTH, Amos; WEISSMAN, Tsachy et al.IEEE transactions on information theory. 2011, Vol 57, Num 3, pp 1223-1236, issn 0018-9448, 14 p.Article

A Simple Converse of Burnashev's Reliability FunctionBERLIN, Peter; NAKIBOGLU, Baris; RIMOLDI, Bixio et al.IEEE transactions on information theory. 2009, Vol 55, Num 7, pp 3074-3080, issn 0018-9448, 7 p.Article

Wiretap Channel With Side InformationYANLING CHEN; HAN VINCK, A. J.IEEE transactions on information theory. 2008, Vol 54, Num 1, pp 395-402, issn 0018-9448, 8 p.Article

  • Page / 16