Zaloguj się

Gotowe bibliografie tematyczne / Discrete memoryless channel / Artykuły w czasopismach

Artykuły w czasopismach na temat „Discrete memoryless channel”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten 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:

Sprawdź 50 najlepszych artykułów w czasopismach 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.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

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.

11

Phamdo, N., i N. Farvardin. "Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding". IEEE Transactions on Information Theory 40, nr 1 (1994): 186–93. http://dx.doi.org/10.1109/18.272478.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Jiang, Shaoquan. "(Im)possibility of Deterministic Commitment Over a Discrete Memoryless Channel". IEEE Transactions on Information Forensics and Security 9, nr 9 (wrzesień 2014): 1406–15. http://dx.doi.org/10.1109/tifs.2014.2335113.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Nakagawa, K., i F. Kanaya. "A new geometric capacity characterization of a discrete memoryless channel". IEEE Transactions on Information Theory 34, nr 2 (marzec 1988): 318–21. http://dx.doi.org/10.1109/18.2641.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Bross, Shraga I., Yossef Steinberg i Stephan Tinguely. "The Discrete Memoryless Interference Channel With One-Sided Generalized Feedback". IEEE Transactions on Information Theory 59, nr 7 (lipiec 2013): 4171–91. http://dx.doi.org/10.1109/tit.2013.2252419.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Tan, Vincent Yan Fu. "On the Reliability Function of the Discrete Memoryless Relay Channel". IEEE Transactions on Information Theory 61, nr 4 (kwiecień 2015): 1550–73. http://dx.doi.org/10.1109/tit.2015.2400999.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Sun, Hua, Soon Xin Ng i Lajos Hanzo. "Discrete-input continuous-output memoryless channel capacity of cooperative hierarchical modulation". IET Communications 10, nr 1 (4.01.2016): 65–71. http://dx.doi.org/10.1049/iet-com.2015.0359.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Shayevitz, Ofer, i Michèle Wigger. "On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback". IEEE Transactions on Information Theory 59, nr 3 (marzec 2013): 1329–45. http://dx.doi.org/10.1109/tit.2012.2227670.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

LANG, Fei, i Bao-yun WANG. "Achievable rate for three-node discrete memoryless relay channel with generalized feedbacks". Journal of China Universities of Posts and Telecommunications 19, nr 2 (kwiecień 2012): 15–21. http://dx.doi.org/10.1016/s1005-8885(11)60240-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Matsumoto, Ryutaroh, i Tomohiko Uyematsu. "Lower bound for the quantum capacity of a discrete memoryless quantum channel". Journal of Mathematical Physics 43, nr 9 (wrzesień 2002): 4391–403. http://dx.doi.org/10.1063/1.1497999.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Zhong, Yangfan, Fady Alajaji i L. Lorne Campbell. "Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems". IEEE Transactions on Information Theory 55, nr 4 (kwiecień 2009): 1487–518. http://dx.doi.org/10.1109/tit.2009.2013018.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Gabbai, Y., i S. I. Bross. "Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations". IEEE Transactions on Information Theory 52, nr 11 (listopad 2006): 4989–5007. http://dx.doi.org/10.1109/tit.2006.883554.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Yangfan Zhong, F. Alajaji i L. L. Campbell. "On the joint source-channel coding error exponent for discrete memoryless systems". IEEE Transactions on Information Theory 52, nr 4 (kwiecień 2006): 1450–68. http://dx.doi.org/10.1109/tit.2006.871608.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Bross, Shraga I. "On the Discrete Memoryless Partially Cooperative Relay Broadcast Channel and the Broadcast Channel With Cooperating Decoders". IEEE Transactions on Information Theory 55, nr 5 (maj 2009): 2161–82. http://dx.doi.org/10.1109/tit.2009.2016068.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Dai, Bin, A. J. Han Vinck i Yuan Luo. "Wiretap Channel in the Presence of Action-Dependent States and Noiseless Feedback". Journal of Applied Mathematics 2013 (2013): 1–17. http://dx.doi.org/10.1155/2013/423619.

Pełny tekst źródła

Streszczenie:

We investigate the wiretap channel in the presence of action-dependent states and noiseless feedback. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel states and then generates the channel input sequence based on the state sequence, the message, and the noiseless feedback, where the noiseless feedback is from the output of the main channel to the channel encoder. The main channel and the wiretap channel are two discrete memoryless channels (DMCs), and they are connected with the legitimate receiver and the wiretapper, respectively. The transition probability distribution of the main channel depends on the channel state. Measuring wiretapper’s uncertainty about the message by equivocation, the capacity equivocation regions are provided both for the case where the channel inputs are allowed to depend noncausally on the state sequence and the case where they are restricted to causal dependence. Furthermore, the secrecy capacities for both cases are formulated, which provide the best transmission rate with perfect secrecy. The result is further explained via a binary example.

Style APA, Harvard, Vancouver, ISO itp.

25

H., Prashantha Kumar, Sripati U., Rajesh Shetty K. i Shankarananda B. ""STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM"". ICTACT Journal on Communication Technology 3, nr 1 (1.03.2012): 498–503. http://dx.doi.org/10.21917/ijct.2012.0069.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Zhang, Xiaoyu, Sheng Chen i Lajos Hanzo. "On the Discrete-Input Continuous-Output Memoryless Channel Capacity of Layered ACO-OFDM". Journal of Lightwave Technology 38, nr 18 (15.09.2020): 4955–68. http://dx.doi.org/10.1109/jlt.2020.2996541.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Bross, S. I. "A Converse Result for the Discrete Memoryless Relay Channel With Relay–Transmitter Feedback". IEEE Transactions on Information Theory 52, nr 8 (sierpień 2006): 3789–92. http://dx.doi.org/10.1109/tit.2006.878222.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Abedi, Ali, i Amir K. Khandani. "Invariance Properties of Binary Linear Codes Over a Memoryless Channel With Discrete Input". IEEE Transactions on Information Theory 53, nr 3 (marzec 2007): 1215–18. http://dx.doi.org/10.1109/tit.2006.890719.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Costa, M., i A. E. Gamal. "The capacity region of the discrete memoryless interference channel with strong interference (Corresp.)". IEEE Transactions on Information Theory 33, nr 5 (wrzesień 1987): 710–11. http://dx.doi.org/10.1109/tit.1987.1057340.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Barg, A. "A low-rate bound on the reliability of a quantum discrete memoryless channel". IEEE Transactions on Information Theory 48, nr 12 (grudzień 2002): 3096–100. http://dx.doi.org/10.1109/tit.2002.805080.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Granada, Imanol, Pedro Crespo i Javier Garcia-Frías. "Combining the Burrows-Wheeler Transform and RCM-LDGM Codes for the Transmission of Sources with Memory at High Spectral Efficiencies". Entropy 21, nr 4 (8.04.2019): 378. http://dx.doi.org/10.3390/e21040378.

Pełny tekst źródła

Streszczenie:

In this paper, we look at the problem of implementing high-throughput Joint Source- Channel (JSC) coding schemes for the transmission of binary sources with memory over AWGN channels. The sources are modeled either by a Markov chain (MC) or a hidden Markov model (HMM). We propose a coding scheme based on the Burrows-Wheeler Transform (BWT) and the parallel concatenation of Rate-Compatible Modulation and Low-Density Generator Matrix (RCM-LDGM) codes. The proposed scheme uses the BWT to convert the original source with memory into a set of independent non-uniform Discrete Memoryless (DMS) binary sources, which are then separately encoded, with optimal rates, using RCM-LDGM codes.

Style APA, Harvard, Vancouver, ISO itp.

32

Yin, Xinxing, Zhi Xue i Bin Dai. "Capacity-Equivocation Regions of the DMBCs with Noiseless Feedback". Mathematical Problems in Engineering 2013 (2013): 1–13. http://dx.doi.org/10.1155/2013/102069.

Pełny tekst źródła

Streszczenie:

The discrete memoryless broadcast channels (DMBCs) with noiseless feedback are studied. The entire capacity-equivocation regions of two models of the DMBCs with noiseless feedback are obtained. One is the degraded DMBCs with rate-limited feedback; the other is thelessandreversely less noisyDMBCs with causal feedback. In both models, two kinds of messages are transmitted. The common message is to be decoded by both the legitimate receiver and the eavesdropper, while the confidential message is only for the legitimate receiver. Our results generalize the secrecy capacity of the degraded wiretap channel with rate-limited feedback (Ardestanizadeh et al., 2009) and the restricted wiretap channel with noiseless feedback (Dai et al., 2012). Furthermore, we use a simpler and more intuitive deduction to get the single-letter characterization of the capacity-equivocation region, instead of relying on the recursive argument which is complex and not intuitive.

Style APA, Harvard, Vancouver, ISO itp.

33

Huber, Johannes, i Thorsten Hehn. "The lowest-possible BER and FER for any discrete memoryless channel with given capacity". IEEE Transactions on Communications 57, nr 10 (październik 2009): 2849–52. http://dx.doi.org/10.1109/tcomm.2009.10.080058.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Peleg, Michael, i Shlomo Shamai(Shitz). "Efficient Communication Over the Discrete-Time Memoryless Rayleigh Fading Channel with Turbo Coding/Decoding". European Transactions on Telecommunications 11, nr 5 (wrzesień 2000): 475–85. http://dx.doi.org/10.1002/ett.4460110505.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Kumar, H., Udupi Sripati, K. Shetty i B. Shankarananda. "Soft Decision Fano Decoding of Block Codes Over Discrete Memoryless Channel Using Tree Diagram". Journal of Electrical Engineering 63, nr 1 (1.01.2012): 59–64. http://dx.doi.org/10.2478/v10187-012-0009-y.

Pełny tekst źródła

Streszczenie:

Soft Decision Fano Decoding of Block Codes Over Discrete Memoryless Channel Using Tree DiagramA novel low complexity soft decision technique which allows the decoding of block codes with tree structure is proposed. These codes are shown to have a convenient tree structure that allows Fano decoding techniques to be used to decode them. The Fano algorithm searches through the tree structure of the block code for a path which has the optimal value of the Fano metric function. When a new candidate codeword is found, an optimality check is performed on it by using the threshold. If checked successfully, the candidate codeword is the most likely codeword and the search stops. The basic idea of this approach is to achieve a good error performance progressively in a minimum number of steps. For each decoding step, the error performance is tightly bounded and the decoding is terminated at the stage where either optimum or near optimum error performance is achieved. As a result, more flexibility in the trade off between performance and decoding complexity is provided. Some examples of the tree construction and the soft decision Fano decoding procedure are discussed.

Style APA, Harvard, Vancouver, ISO itp.

36

Wang, Bin, Jun Deng, Yanjing Sun, Wangmei Guo i Guiguo Feng. "Secrecy Capacity of a Class of Erasure Wiretap Channels in WBAN". Sensors 18, nr 12 (26.11.2018): 4135. http://dx.doi.org/10.3390/s18124135.

Pełny tekst źródła

Streszczenie:

In wireless body area networks (WBANs), the secrecy of personal health information is vulnerable to attacks due to the openness of wireless communication. In this paper, we study the security problem of WBANs, where there exists an attacker or eavesdropper who is able to observe data from part of sensors. The legitimate communication within the WBAN is modeled as a discrete memoryless channel (DMC) by establishing the secrecy capacity of a class of finite state Markov erasure wiretap channels. Meanwhile, the tapping of the eavesdropper is modeled as a finite-state Markov erasure channel (FSMEC). A pair of encoder and decoder are devised to make the eavesdropper have no knowledge of the source message, and enable the receiver to recover the source message with a small decoding error. It is proved that the secrecy capacity can be achieved by migrating the coding scheme for wiretap channel II with the noisy main channel. This method provides a new idea solving the secure problem of the internet of things (IoT).

Style APA, Harvard, Vancouver, ISO itp.

37

Song, Xiaoxia, i Yong Li. "Compress-and-Forward for Relay Broadcast Channels without Common Messages". Cybernetics and Information Technologies 15, nr 2 (1.06.2015): 97–110. http://dx.doi.org/10.1515/cait-2015-0031.

Pełny tekst źródła

Streszczenie:

Abstract This paper is connected with compress-and-forward strategy for two-user relay broadcast channels without common messages, where the relay node has private messages from the source, in addition to aiding traditional communication from the source to the destination. For this channel we derive two achievable rate regions based on the compress-and-forward strategy in cases of discrete memoryless channels and Gaussian channels, respectively. The numerical results for Gaussian relay broadcast channel show that the inner bound based on the compress-and-forward strategy improves when all the messages without peeling off any components are compressed and sent to the receiver. It also verifies that the inner bound based on compress-and-forward strategy is better than that based on decode-and-forward strategy, when the relay node is near to the sink node. Moreover, the rate region of the broadcast channel improves considerably when the collaboration between the two receivers is allowed. So the relay node can provide residual resources to help the communication between the source and the sink after its communication rate is satisfied, which gives some insights to select an available relay node in a practical communication system.

Style APA, Harvard, Vancouver, ISO itp.

38

Raghavan, S. A., J. K. Wolf i L. B. Milstein. "On the cutoff rate of a discrete memoryless channel with (d, k)-constrained input sequences". IEEE Journal on Selected Areas in Communications 10, nr 1 (1992): 233–41. http://dx.doi.org/10.1109/49.124482.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Yang, Min, Haojie Zhang, Xiaoping Li, Qianqian Sun i Jiancheng Tang. "The PSK Channel Capacity Estimation under Dynamic Plasma Sheath Channel". International Journal of Antennas and Propagation 2020 (9.04.2020): 1–9. http://dx.doi.org/10.1155/2020/3652429.

Pełny tekst źródła

Streszczenie:

During the reentry process, the plasma sheath covering the surface of the hypersonic aircraft will cause the amplitude attenuation and phase jitter of the communication electromagnetic waves. Channel parameters such as the electron density and collision frequency of the plasma sheath reflect the changing trend of the plasma sheath, and these parameters can be measured by physical means. However, these parameters cannot directly reflect the change of the channel communication ability and cannot directly serve the design of communication methods in the plasma sheath. Due to the particularity of the plasma sheath, the traditional channel estimation method for Additive White Gaussian Noise channels will no longer be applicable. This paper presents a channel capacity estimation method for dynamic plasma sheath. First, the plasma sheath is equivalent to a discrete input continuous output memoryless channel, and then the channel capacity expression is derived according to Shannon formula. Finally, the channel capacity of the dynamic plasma sheath is estimated by calculating the transition probability density function. The simulation results show that the channel capacity of the dynamic plasma sheath is affected by both the signal-to-noise ratio (SNR) and the dynamic parameters of the plasma sheath. When the electron density is small, the channel capacity is mainly affected by the SNR. As the electron density increases, the dynamic parameters of the plasma sheath gradually become the main factor affecting the channel capacity. This method is a theoretical analysis of the channel capacity when the channel parameters of the plasma channel are known, and it is meaningful for conducting the work of communication methods design.

Style APA, Harvard, Vancouver, ISO itp.

40

Chen, Yu, Iman Tavakkolnia, Alex Alvarado i Majid Safari. "On the Capacity of Amplitude Modulated Soliton Communication over Long Haul Fibers". Entropy 22, nr 8 (15.08.2020): 899. http://dx.doi.org/10.3390/e22080899.

Pełny tekst źródła

Streszczenie:

The capacity limits of fiber-optic communication systems in the nonlinear regime are not yet well understood. In this paper, we study the capacity of amplitude modulated first-order soliton transmission, defined as the maximum of the so-called time-scaled mutual information. Such definition allows us to directly incorporate the dependence of soliton pulse width to its amplitude into capacity formulation. The commonly used memoryless channel model based on noncentral chi-squared distribution is initially considered. Applying a variance normalizing transform, this channel is approximated by a unit-variance additive white Gaussian noise (AWGN) model. Based on a numerical capacity analysis of the approximated AWGN channel, a general form of capacity-approaching input distributions is determined. These optimal distributions are discrete comprising a mass point at zero (off symbol) and a finite number of mass points almost uniformly distributed away from zero. Using this general form of input distributions, a novel closed-form approximation of the capacity is determined showing a good match to numerical results. Finally, mismatch capacity bounds are developed based on split-step simulations of the nonlinear Schro¨dinger equation considering both single soliton and soliton sequence transmissions. This relaxes the initial assumption of memoryless channel to show the impact of both inter-soliton interaction and Gordon–Haus effects. Our results show that the inter-soliton interaction effect becomes increasingly significant at higher soliton amplitudes and would be the dominant impairment compared to the timing jitter induced by the Gordon–Haus effect.

Style APA, Harvard, Vancouver, ISO itp.

41

Bross, S. I., i A. Lapidoth. "An Improved Achievable Region for the Discrete Memoryless Two-User Multiple-Access Channel With Noiseless Feedback". IEEE Transactions on Information Theory 51, nr 3 (marzec 2005): 811–33. http://dx.doi.org/10.1109/tit.2004.842700.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Sreekumar, Sreejith, Asaf Cohen i Deniz Gündüz. "Privacy-Aware Distributed Hypothesis Testing". Entropy 22, nr 6 (16.06.2020): 665. http://dx.doi.org/10.3390/e22060665.

Pełny tekst źródła

Streszczenie:

A distributed binary hypothesis testing (HT) problem involving two parties, a remote observer and a detector, is studied. The remote observer has access to a discrete memoryless source, and communicates its observations to the detector via a rate-limited noiseless channel. The detector observes another discrete memoryless source, and performs a binary hypothesis test on the joint distribution of its own observations with those of the observer. While the goal of the observer is to maximize the type II error exponent of the test for a given type I error probability constraint, it also wants to keep a private part of its observations as oblivious to the detector as possible. Considering both equivocation and average distortion under a causal disclosure assumption as possible measures of privacy, the trade-off between the communication rate from the observer to the detector, the type II error exponent, and privacy is studied. For the general HT problem, we establish single-letter inner bounds on both the rate-error exponent-equivocation and rate-error exponent-distortion trade-offs. Subsequently, single-letter characterizations for both trade-offs are obtained (i) for testing against conditional independence of the observer’s observations from those of the detector, given some additional side information at the detector; and (ii) when the communication rate constraint over the channel is zero. Finally, we show by providing a counter-example where the strong converse which holds for distributed HT without a privacy constraint does not hold when a privacy constraint is imposed. This implies that in general, the rate-error exponent-equivocation and rate-error exponent-distortion trade-offs are not independent of the type I error probability constraint.

Style APA, Harvard, Vancouver, ISO itp.

43

Hu, Xiaoyan, Liang Jin, Kaizhi Huang, Keming Ma, Changcheng Song i Shuaifang Xiao. "A Secure Communication Scheme Based on Equivalent Interference Channel Assisted by Physical Layer Secret Keys". Security and Communication Networks 2020 (20.10.2020): 1–15. http://dx.doi.org/10.1155/2020/8840645.

Pełny tekst źródła

Streszczenie:

Due to the channel estimation error, most of the physical layer secret key generation schemes need information reconciliation to correct error key bits, resulting in reduced efficiency. To solve the problem, this work proposes a novel secure communication scheme based on a equivalent interference channel. Different keys generated from imperfect channel state information are directly applied to signal scrambling and descrambling, which is equivalent to the process of a signal passing through an interference channel. Legitimate communication parties can reduce interference with the help of similar keys and channel coding without sending additional signals, while the eavesdropper channel is deteriorated due to the spatial decorrelation. For this kind of schemes, we first establish a discrete memoryless broadcast channel model to derive the expressions of bit error rate (BER), channel capacity, and security capacity for performance analysis. Simulation results verify the derivations that the proposed scheme achieves secure communication with a correlated eavesdropping channel and has a higher upper bound of transmission rate. Furthermore, we design a new metric to evaluate the efficiency and the result shows that the proposed scheme has superior performance on error reconciliation efficiency, despite its slight increase in BER.

Style APA, Harvard, Vancouver, ISO itp.

44

Winter, A. "Quantum and classical message protect identification via quantum channels". Quantum Information and Computation 4, nr 6&7 (grudzień 2004): 564–78. http://dx.doi.org/10.26421/qic4.6-7-14.

Pełny tekst źródła

Streszczenie:

We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical--quantum (cq) channels and ``quantum fingerprinting''. We show that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is in contrast to all previously considered models, where it turns out to equal the common randomness capacity (equals transmission capacity in our case): in particular, for a noiseless qubit, we show the identification capacity to be 2, while transmission and common randomness capacity are 1. Then we turn to a natural concept of identification of quantum messages (i.e. a notion of ``fingerprint'' for quantum states). This is much closer to quantum information transmission than its classical counterpart (for one thing, the code length grows only exponentially, compared to double exponentially for classical identification). Indeed, we show how the problem exhibits a nice connection to visible quantum coding. Astonishingly, for the noiseless qubit channel this capacity turns out to be 2: in other words, one can compress two qubits into one and this is optimal. In general however, we conjecture quantum identification capacity to be different from classical identification capacity.

Style APA, Harvard, Vancouver, ISO itp.

45

Fadel Shady, Mohamed, i Aria Nosratinia. "MISO Broadcast Channel under Unequal Link Coherence Times and Channel State Information". Entropy 22, nr 9 (1.09.2020): 976. http://dx.doi.org/10.3390/e22090976.

Pełny tekst źródła

Streszczenie:

The broadcast channel may experience unequal link coherence times due to a number of factors including variation in node mobility or local scattering conditions. This means the block fading model for different links may have nonidentical block length, and the channel state information for the links may also not be identical. The faster the fading and the shorter the fading block length, the more often the link needs to be trained and estimated at the receiver, and the more likely that channel state information (CSI) is stale or unavailable at the transmitter. This paper investigates a MISO broadcast channel where some receivers experience longer coherence intervals and other receivers experience shorter coherence intervals and must estimate their receive-side CSI (CSIR) frequently. We consider a variety of transmit-side CSI (CSIT) conditions for the abovementioned model, including no CSIT, delayed CSIT, or hybrid CSIT. To investigate the degrees of freedom region, we employ interference alignment and beamforming along with a product superposition that allows simultaneous but noncontaminating transmission of pilots and data to different receivers. Outer bounds employ the extremal entropy inequality as well as a bounding of the performance of a discrete, memoryless, multiuser, multilevel broadcast channel. For several cases, inner and outer bounds are established that either partially meet, or the gap diminishes with increasing coherence times.

Style APA, Harvard, Vancouver, ISO itp.

46

Li, Fangbiao, i Zhi Xue. "A Class of Three-Receiver Broadcast Channels with Degraded Message Sets and Side Information". Mathematical Problems in Engineering 2013 (2013): 1–8. http://dx.doi.org/10.1155/2013/406826.

Pełny tekst źródła

Streszczenie:

We study a class of three-receiver discrete memoryless broadcast channel (DM-BC) with three degraded message sets and side information. We derive achievable rate region for this three-receive DM-BC with side information noncausally available at the transmitter. When the receivers follow a degradedness order, we determine the perfect secrecy capacity region of this class of three-receiver DM-BC with three degraded message sets and side information noncausally available at both the transmitter and the receiver. The achievable secrecy region of this paper subsumes Steinberg’s rate region for two-receiver degraded BC with the side information and the secrecy capacity region for one-receiver two-eavesdropper DM-BC with no side information as its special cases.

Style APA, Harvard, Vancouver, ISO itp.

47

Rutkowski, Jerzy. "Evaluation of the Correlation Between Formative Tests and Final Exam Results – Theory of Information Approach". International Journal of Electronics and Telecommunications 62, nr 1 (1.03.2016): 55–60. http://dx.doi.org/10.1515/eletel-2016-0007.

Pełny tekst źródła

Streszczenie:

Abstract Today, computerization of the Assessment Program is a norm, numerous advantages of Computer-Assisted Assessment (CAA), both formative and summative, can be enlisted. Motivating students to systematic work and Self- Regulated Learning seems to be the biggest challenge faced by the teacher. This motivation can be reached by providing students with clear information that shows an evident effectiveness of formative quizzes, undisputable correlation between student engagement in taking formative quizzes and the final exam result. It is proposed to evaluate this effectiveness quantitatively in the field of Information Theory, using the Discrete Memoryless Channel description of relationship between the set of quizzes taken and the set of exam results. The Case Study is presented and if proves high correlation between these two sets.

Style APA, Harvard, Vancouver, ISO itp.

48

Li, Haobo, i Ning Cai. "Computing Classical-Quantum Channel Capacity Using Blahut–Arimoto Type Algorithm: A Theoretical and Numerical Analysis". Entropy 22, nr 2 (16.02.2020): 222. http://dx.doi.org/10.3390/e22020222.

Pełny tekst źródła

Streszczenie:

Based on Arimoto’s work in 1972, we propose an iterative algorithm for computing the capacity of a discrete memoryless classical-quantum channel with a finite input alphabet and a finite dimensional output, which we call the Blahut–Arimoto algorithm for classical-quantum channel, and an input cost constraint is considered. We show that, to reach ε accuracy, the iteration complexity of the algorithm is upper bounded by log n log ε ε where n is the size of the input alphabet. In particular, when the output state { ρ x } x ∈ X is linearly independent in complex matrix space, the algorithm has a geometric convergence. We also show that the algorithm reaches an ε accurate solution with a complexity of O ( m 3 log n log ε ε ) , and O ( m 3 log ε log ( 1 − δ ) ε D ( p * | | p N 0 ) ) in the special case, where m is the output dimension, D ( p * | | p N 0 ) is the relative entropy of two distributions, and δ is a positive number. Numerical experiments were performed and an approximate solution for the binary two-dimensional case was analysed.

Style APA, Harvard, Vancouver, ISO itp.

49

Hof, E., i S. I. Bross. "On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets". IEEE Transactions on Information Theory 52, nr 11 (listopad 2006): 5023–44. http://dx.doi.org/10.1109/tit.2006.883543.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Hamkins, J. "Accurate Computation of the Performance of<tex>$M$</tex>-ary Orthogonal Signaling on a Discrete Memoryless Channel". IEEE Transactions on Communications 52, nr 11 (listopad 2004): 1844–45. http://dx.doi.org/10.1109/tcomm.2004.836561.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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!