Gotowa bibliografia na temat „Discrete memoryless channel”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
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"
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łaHuang, 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łaPiantanida, 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łaWang, 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łaBrijpaul, 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łaWillems, 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łaAbdel-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łaSkoglund, 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łaArora, 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łaDai, 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łaRozprawy doktorskie na temat "Discrete memoryless channel"
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łaMEDEIROS, 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łaMade 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.
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łaZhong, 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łaThesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2008-05-13 22:31:56.425
"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łaLin, 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國立交通大學
電信工程研究所
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.
Książki na temat "Discrete memoryless channel"
Statistical analysis of memoryless discrete channels. Berlin: Humboldt-Universität zu Berlin, 2004.
Znajdź pełny tekst źródłaCzęści książek na temat "Discrete memoryless channel"
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łaAhlswede, 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łaOoi, 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łaYuksel, 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"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"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"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"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łaStreszczenia konferencji na temat "Discrete memoryless channel"
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łaGuo, 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łaSutter, 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łaEtkin, 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łaYagi, 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łaTope, 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łaAhmadipour, 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łaMori, 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łaManakkal, 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łaTope, 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