Gotowe bibliografie tematyczne / Discrete memoryless channel

Gotowa bibliografia na temat „Discrete memoryless channel”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 1 lutego 2022

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Discrete memoryless channel”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Discrete memoryless channel"

1

Sahebi, Aria G., i S. Sandeep Pradhan. "Multilevel Channel Polarization for Arbitrary Discrete Memoryless Channels". IEEE Transactions on Information Theory 59, nr 12 (grudzień 2013): 7839–57. http://dx.doi.org/10.1109/tit.2013.2282611.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Huang, Da Zu, Zhi Gang Chen, Xin Li i Ying Guo. "Quantum Polarization Codes for Capacity-Achieving in Discrete Memoryless Quantum Channel". Applied Mechanics and Materials 44-47 (grudzień 2010): 2978–82. http://dx.doi.org/10.4028/www.scientific.net/amm.44-47.2978.

Pełny tekst źródła
Streszczenie:
Quantum channel combining and splitting, called quantum channel polarization, is suggested to design qubit sequences that achieve the symmetric capacity for any given discrete memoryless quantum channels. The polarized quantum channels can be well-conditioned for quantum channel codes, through which one need to send data at rate 1 by employing quantum channels with capacity near 1 and at rate 0 by employing the remaining quantum channels.
Style APA, Harvard, Vancouver, ISO itp.
3

Piantanida, Pablo, Gerald Matz i Pierre Duhamel. "Outage Behavior of Discrete Memoryless Channels Under Channel Estimation Errors". IEEE Transactions on Information Theory 55, nr 9 (wrzesień 2009): 4221–39. http://dx.doi.org/10.1109/tit.2009.2025574.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Wang, Da Jin, Guang Da Xue i Gui Liang Yan. "Wyner-Ziv Coding over Broadcast Channel with Noncausal Channel Side Information only Known at Encoder". Applied Mechanics and Materials 58-60 (czerwiec 2011): 1572–76. http://dx.doi.org/10.4028/www.scientific.net/amm.58-60.1572.

Pełny tekst źródła
Streszczenie:
We consider the problem of transmitting common message over discrete memoryless broadcast channel (DM-BC) with noncausal discrete memoryless (DM) channel side information (CSI) only known at encoder. Nayak, etc. consider this problem and give a scheme combining Wyner-Ziv coding and Gelfand-Pinsker coding. The Gelfand-Pinsker's code is optimal for point-to-point communication with the encoder accessed to noncausal CSI. But Nair, etc., show that the straightforward extension of Gelfand-Pinsker's code to DM-BC with DM state is not optimal. In this paper, the inner bound of transmitting common message over DM-BC with noncausal DM-CSI only known at encoder is given. The proof of achievability uses Wyner-Ziv coding, Gelfand-Pinsker coding, superposition coding, Marton coding and indirect decoding.
Style APA, Harvard, Vancouver, ISO itp.
5

Brijpaul, K., i B. D. Sharma. "The Performance Function of a Discrete Memoryless Communication Channel". Journal of Information and Optimization Sciences 11, nr 2 (maj 1990): 327–36. http://dx.doi.org/10.1080/02522667.1990.10699026.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Willems, F., i E. van der Meulen. "The discrete memoryless multiple-access channel with cribbing encoders". IEEE Transactions on Information Theory 31, nr 3 (maj 1985): 313–27. http://dx.doi.org/10.1109/tit.1985.1057042.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Abdel-Ghaffar, K. A. S. "Capacity per unit cost of a discrete memoryless channel". Electronics Letters 29, nr 2 (1993): 142. http://dx.doi.org/10.1049/el:19930096.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Skoglund, M. "On channel-constrained vector quantization and index assignment for discrete memoryless channels". IEEE Transactions on Information Theory 45, nr 7 (1999): 2615–22. http://dx.doi.org/10.1109/18.796416.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Arora, H. D., Vijay Kumar i Anjali Dhiman. "Weighted Performance Function for (r, s)-Entropy of Discrete Memoryless Communication Channel under Single Constraint". International Journal of Modeling and Optimization 4, nr 1 (2014): 17–20. http://dx.doi.org/10.7763/ijmo.2014.v4.340.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Dai, Bin, i Yong Tao Wang. "Discrete Memoryless Multiple-Access Wiretap Channel with Non-Cooperative Encoders". Applied Mechanics and Materials 433-435 (październik 2013): 1502–6. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.1502.

Pełny tekst źródła
Streszczenie:
In this paper, the discrete memoryless multiple-access wiretap channel (MAC-WT) with non-cooperative encoders is studied, where two users (cooperation between the users is not allowed) transmit their corresponding confidential messages (no common message) to a legitimate receiver, while an additional wiretapper wishes to obtain the messages via a wiretap channel. The inner and outer bounds on the capacity-equivocation region are provided forthis new model, and the result is further explained via a binary example.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Discrete memoryless channel"

1

Griffiths, Wayne Bradley. "On a posteriori probability decoding of linear block codes over discrete channels". University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0156.

Pełny tekst źródła
Streszczenie:
One of the facets of the mobile or wireless environment is that errors quite often occur in bursts. Thus, strong codes are required to provide protection against such errors. This in turn motivates the employment of decoding algorithms which are simple to implement, yet are still able to attempt to take the dependence or memory of the channel model into account in order to give optimal decoding estimates. Furthermore, such algorithms should be able to be applied for a variety of channel models and signalling alphabets. The research presented within this thesis describes a number of algorithms which can be used with linear block codes. Given the received word, these algorithms determine the symbol which was most likely transmitted, on a symbol-by-symbol basis. Due to their relative simplicity, a collection of algorithms for memoryless channels is reported first. This is done to establish the general style and principles of the overall collection. The concept of matrix diagonalisation may or may not be applied, resulting in two different types of procedure. Ultimately, it is shown that the choice between them should be motivated by whether storage space or computational complexity has the higher priority. As with all other procedures explained herein, the derivation is first performed for a binary signalling alphabet and then extended to fields of prime order. These procedures form the paradigm for algorithms used in conjunction with finite state channel models, where errors generally occur in bursts. In such cases, the necessary information is stored in matrices rather than as scalars. Finally, by analogy with the weight polynomials of a code and its dual as characterised by the MacWilliams identities, new procedures are developed for particular types of Gilbert-Elliott channel models. Here, the calculations are derived from three parameters which profile the occurrence of errors in those models. The decoding is then carried out using polynomial evaluation rather than matrix multiplication. Complementing this theory are several examples detailing the steps required to perform the decoding, as well as a collection of simulation results demonstrating the practical value of these algorithms.
Style APA, Harvard, Vancouver, ISO itp.
2

MEDEIROS, Rex Antonio da Costa. "Zero-Error capacity of quantum channels". Universidade Federal de Campina Grande, 2008. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1320.

Pełny tekst źródła
Streszczenie:
Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-08-01T21:11:37Z No. of bitstreams: 1 REX ANTONIO DA COSTA MEDEIROS - TESE PPGEE 2008..pdf: 1089371 bytes, checksum: ea0c95501b938e0d466779a06faaa4f6 (MD5)
Made available in DSpace on 2018-08-01T21:11:37Z (GMT). No. of bitstreams: 1 REX ANTONIO DA COSTA MEDEIROS - TESE PPGEE 2008..pdf: 1089371 bytes, checksum: ea0c95501b938e0d466779a06faaa4f6 (MD5) Previous issue date: 2008-05-09
Nesta tese, a capacidade erro-zero de canais discretos sem memória é generalizada para canais quânticos. Uma nova capacidade para a transmissão de informação clássica através de canais quânticos é proposta. A capacidade erro-zero de canais quânticos (CEZQ) é definida como sendo a máxima quantidade de informação por uso do canal que pode ser enviada através de um canal quântico ruidoso, considerando uma probabilidade de erro igual a zero. O protocolo de comunicação restringe palavras-código a produtos tensoriais de estados quânticos de entrada, enquanto que medições coletivas entre várias saídas do canal são permitidas. Portanto, o protocolo empregado é similar ao protocolo de Holevo-Schumacher-Westmoreland. O problema de encontrar a CEZQ é reformulado usando elementos da teoria de grafos. Esta definição equivalente é usada para demonstrar propriedades de famílias de estados quânticos e medições que atingem a CEZQ. É mostrado que a capacidade de um canal quântico num espaço de Hilbert de dimensão d pode sempre ser alcançada usando famílias compostas de, no máximo,d estados puros. Com relação às medições, demonstra-se que medições coletivas de von Neumann são necessárias e suficientes para alcançar a capacidade. É discutido se a CEZQ é uma generalização não trivial da capacidade erro-zero clássica. O termo não trivial refere-se a existência de canais quânticos para os quais a CEZQ só pode ser alcançada através de famílias de estados quânticos não-ortogonais e usando códigos de comprimento maior ou igual a dois. É investigada a CEZQ de alguns canais quânticos. É mostrado que o problema de calcular a CEZQ de canais clássicos-quânticos é puramente clássico. Em particular, é exibido um canal quântico para o qual conjectura-se que a CEZQ só pode ser alcançada usando uma família de estados quânticos não-ortogonais. Se a conjectura é verdadeira, é possível calcular o valor exato da capacidade e construir um código de bloco quântico que alcança a capacidade. Finalmente, é demonstrado que a CEZQ é limitada superiormente pela capacidade de Holevo-Schumacher-Westmoreland.
Style APA, Harvard, Vancouver, ISO itp.
3

Bharadwaj, Vinay K. "Joint source/channel coding for discrete memoryless channels: Lessons to learn". Thesis, 2000. http://hdl.handle.net/1911/17324.

Pełny tekst źródła
Streszczenie:
The design of optimal joint source/channel coding and decoding is examined for discrete memoryless channels with end-to-end distortion as the criterion for reliable communication. Joint source/channel encoders which map sequences of source symbols directly to sequences of channel symbols without any intermediate "bit" representation of source are considered. Optimum joint source/channel decoder that minimizes end-to-end distortion for a given encoder mapping is derived. The encoder mapping can be many to one, in the sense that many source sequences can be mapped to one sequence of channel symbols. To begin with, as an exercise, random coding bound on end-to-end distortion is derived for a general Maximum A Posteriori (MAP) decoder which has some estimate on the apriori probabilities of source symbols. It is shown that, the KL distance of the actual apriori probabilities with the estimated ones plays an important role. Then, a random coding bound on end-to-end distortion is derived with our optimal minimum distortion decoder mentioned above for the case when all source symbols are equally likely. It is shown that the performance increase with minimum distortion decoding as opposed to MAP (same as Maximum Likelihood (ML) decoding in this case when all source symbols are equally likely) is characterized by the faster decay of end-to-end distortion with respect to channel use.
Style APA, Harvard, Vancouver, ISO itp.
4

Zhong, Yangfan. "Joint Source-Channel Coding Reliability Function for Single and Multi-Terminal Communication Systems". Thesis, 2008. http://hdl.handle.net/1974/1207.

Pełny tekst źródła
Streszczenie:
Traditionally, source coding (data compression) and channel coding (error protection) are performed separately and sequentially, resulting in what we call a tandem (separate) coding system. In practical implementations, however, tandem coding might involve a large delay and a high coding/decoding complexity, since one needs to remove the redundancy in the source coding part and then insert certain redundancy in the channel coding part. On the other hand, joint source-channel coding (JSCC), which coordinates source and channel coding or combines them into a single step, may offer substantial improvements over the tandem coding approach. This thesis deals with the fundamental Shannon-theoretic limits for a variety of communication systems via JSCC. More specifically, we investigate the reliability function (which is the largest rate at which the coding probability of error vanishes exponentially with increasing blocklength) for JSCC for the following discrete-time communication systems: (i) discrete memoryless systems; (ii) discrete memoryless systems with perfect channel feedback; (iii) discrete memoryless systems with source side information; (iv) discrete systems with Markovian memory; (v) continuous-valued (particularly Gaussian) memoryless systems; (vi) discrete asymmetric 2-user source-channel systems. For the above systems, we establish upper and lower bounds for the JSCC reliability function and we analytically compute these bounds. The conditions for which the upper and lower bounds coincide are also provided. We show that the conditions are satisfied for a large class of source-channel systems, and hence exactly determine the reliability function. We next provide a systematic comparison between the JSCC reliability function and the tandem coding reliability function (the reliability function resulting from separate source and channel coding). We show that the JSCC reliability function is substantially larger than the tandem coding reliability function for most cases. In particular, the JSCC reliability function is close to twice as large as the tandem coding reliability function for many source-channel pairs. This exponent gain provides a theoretical underpinning and justification for JSCC design as opposed to the widely used tandem coding method, since JSCC will yield a faster exponential rate of decay for the system error probability and thus provides substantial reductions in complexity and coding/decoding delay for real-world communication systems.
Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2008-05-13 22:31:56.425
Style APA, Harvard, Vancouver, ISO itp.
5

"Zero error decision feedback capacity of discrete memoryless channels". Massachusetts Institute of Technology, Laboratory for Information and Decision Systems], 1989. http://hdl.handle.net/1721.1/3166.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Lin, Hsuan-Yin, i 林玄寅. "Optimal Ultra-Small Block-Codes for Binary Input Discrete Memoryless Channels". Thesis, 2013. http://ndltd.ncl.edu.tw/handle/20041495285802019942.

Pełny tekst źródła
Streszczenie:
博士
國立交通大學
電信工程研究所
101
Optimal block-codes with a very small number of codewords are investigated for the binary input discrete memoryless channels. Those channels are the binary asymmetric channel (BAC), including the two special cases of the binary symmetric channel (BSC) and the Z-channel (ZC). The binary erasure channel (BEC) is a common used channel with ternary output. For the asymmetric channels, a general BAC, it is shown that so-called flip codes are optimal codes with two codewords. The optimal (in the sense of minimum average error probability, using maximum likelihood decoding) code structure is derived for the ZC in the cases of two, three, and four codewords and an arbitrary finite blocklength. For the symmetric channels, the BSC and the BEC, the optimal code structure is derived with at most three codewords and an arbitrary finite blocklength, a statement for linear optimal codes with four codes is also given. The derivation of these optimal codes relies heavily on a new approach of constructing and analyzing the codebook matrix not row-wise (codewords), but column-wise. This new tool allows an elegant definition of interesting code families that is recursive in the blocklength n and admits their exact analysis of error performance that is not based on the union bound or other approximations.
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Discrete memoryless channel"

1

Statistical analysis of memoryless discrete channels. Berlin: Humboldt-Universität zu Berlin, 2004.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Discrete memoryless channel"

1

Winter, Andreas, Anderson C. A. Nascimento i Hideki Imai. "Commitment Capacity of Discrete Memoryless Channels". W Cryptography and Coding, 35–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-40974-8_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Ahlswede, Rudolf. "Identification via Discrete Memoryless Wiretap Channels". W Identification and Other Probabilistic Models, 117–30. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-65072-8_6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Ooi, James M. "Discrete Memoryless Channels: An Introduction to the Framework". W Coding for Channels with Feedback, 9–60. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5719-7_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Yuksel, Melda, i Elza Erkip. "Information Theoretical Limits on Cooperative Communications". W Cooperative Communications for Improved Wireless Network Transmission, 1–28. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-665-5.ch001.

Pełny tekst źródła
Streszczenie:
This chapter provides an overview of the information theoretic foundations of cooperative communications. Earlier information theoretic achievements, as well as the more recent developments, are discussed. The analysis accounts for full/half-duplex node, and for multiple relays. Various channel models such as discrete memoryless, additive white Gaussian noise (AWGN), and fading channels are considered. Cooperative communication protocols are investigated using capacity, diversity, and diversity-multiplexing tradeoff (DMT) as performance metrics. Overall, this chapter provides a comprehensive view on the foundations of and the state-of-the-art reached in the theory of cooperative communications.
Style APA, Harvard, Vancouver, ISO itp.
5

"Discrete memoryless channels and their capacity–cost functions". W The Theory of Information and Coding, 50–74. Cambridge University Press, 2002. http://dx.doi.org/10.1017/cbo9780511606267.007.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

"Discrete memoryless channels and their capacity–cost functions". W The Theory of Information and Coding, 50–74. Cambridge University Press, 2004. http://dx.doi.org/10.1017/cbo9780511819896.007.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

"Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I". W Claude E. Shannon. IEEE, 2009. http://dx.doi.org/10.1109/9780470544242.ch23.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

"Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II". W Claude E. Shannon. IEEE, 2009. http://dx.doi.org/10.1109/9780470544242.ch24.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Discrete memoryless channel"

1

Tepedelenlioglu, Cihan. "Channel Inclusion Beyond Discrete Memoryless Channels". W 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. http://dx.doi.org/10.1109/isit45174.2021.9517862.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Guo, Ying, Moon Ho Lee i Jun Li. "A novel channel polarization on binary discrete memoryless channels". W 2010 IEEE International Conference on Communication Systems (ICCS). IEEE, 2010. http://dx.doi.org/10.1109/iccs.2010.5685897.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Sutter, David, Peyman Mohajerin Esfahani, Tobias Sutter i John Lygeros. "Efficient approximation of discrete memoryless channel capacities". W 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6875365.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Etkin, Raul, i Erik Ordentlich. "Discrete Memoryless Interference Channel: New Outer Bound". W 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557190.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Yagi, Hideki, i Te Sun Han. "Variable-Length Channel Resolvability for Discrete Memoryless Sources and Channels". W 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437858.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Tope, Michael A., i Joel M. Morris. "On channel rate discovery for discrete memoryless binary output channels". W 2017 IEEE 38th Sarnoff Symposium. IEEE, 2017. http://dx.doi.org/10.1109/sarnof.2017.8080389.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Ahmadipour, Mehrasa, Sadaf Salehkalaibar, Mohammad Hossein Yassaee i Vincent Y. F. Tan. "Covert Communication Over a Compound Discrete Memoryless Channel". W 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849494.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Mori, Ryuhei, i Toshiyuki Tanaka. "Channel polarization on q-ary discrete memoryless channels by arbitrary kernels". W 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513568.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Manakkal, R., i B. Rimoldi. "A source-channel coding scheme for discrete memoryless channels with feedback". W Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523596.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Tope, Michael A., i Joel M. Morris. "Near optimal channel rate discovery for discrete memoryless binary output channels". W 2017 IEEE Military Communications Conference (MILCOM). IEEE, 2017. http://dx.doi.org/10.1109/milcom.2017.8170826.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Discrete memoryless channel” dla poszczególnych typów źródeł:
Artykuły w czasopismach
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii