Search

The inherent association between real quantum systems and their surrounding environment invariably results in decoherence, leading to the loss of entanglement. This diminution in entanglement coincides with a decline in the fidelity of transmitted information using the entangled quantum resource. This study scrutinizes the impact of the squeezed generalized amplitude damping (SGAD) channel on quantum Fisher information (QFI) parameters. The SGAD channel model, a versatile framework, is also employed to simulate other dissipative channels, including amplitude damping (AD) and generalized amplitude damping (GAD). Kraus operators facilitate the modeling of noisy channels. The results reveal that, within the SGAD channel, the QFI remains impervious to the squeezing variables (r and Φ ). In the GAD channel, F θ GAD undergoes enhancement to a constant value with an upswing in temperature (T), while the ϕ parameter in the GAD channel, F ϕ GAD , akin to the SGAD channel, surges around T = 2 before complete loss ensues. Concerning the AD channel, the θ component of the QFI initially experiences decoherence with an augmentation in the AD noise parameter (λ ). Subsequently, it is restored to its initial value with a further escalation in λ . Conversely, the ϕ component of the QFI in the AD channel experiences decoherence with an elevation in the AD noise parameter (λ ). [ABSTRACT FROM AUTHOR]

Abstract The inherent association between real quantum systems and their surrounding environment invariably results in decoherence, leading to the loss of entanglement. This diminution in entanglement coincides with a decline in the fidelity of transmitted information using the entangled quantum resource. This study scrutinizes the impact of the squeezed generalized amplitude damping (SGAD) channel on quantum Fisher information (QFI) parameters. The SGAD channel model, a versatile framework, is also employed to simulate other dissipative channels, including amplitude damping (AD) and generalized amplitude damping (GAD). Kraus operators facilitate the modeling of noisy channels. The results reveal that, within the SGAD channel, the QFI remains impervious to the squeezing variables (r and $$\Phi$$ Φ ). In the GAD channel, $$F\theta _{GAD}$$ F θ GAD undergoes enhancement to a constant value with an upswing in temperature (T), while the $$\phi$$ ϕ parameter in the GAD channel, $$F\phi _{GAD}$$ F ϕ GAD , akin to the SGAD channel, surges around T = 2 before complete loss ensues. Concerning the AD channel, the $$\theta$$ θ component of the QFI initially experiences decoherence with an augmentation in the AD noise parameter ( $$\lambda$$ λ ). Subsequently, it is restored to its initial value with a further escalation in $$\lambda$$ λ . Conversely, the $$\phi$$ ϕ component of the QFI in the AD channel experiences decoherence with an elevation in the AD noise parameter ( $$\lambda$$ λ ).

Quantum key distribution, which is based on the laws of physics, has revolutionized the protection of communication information. However, before QKD can be extensively utilized, a number of critical challenges must be overcome, namely, the noise of channels. Key qubits are distorted by passing through noisy channels, which leads to errors and significantly impact the security, which is the most crucial aspect of QKD. In this paper, we utilize quantum gates and environment-assisted measurement to enhance the performance of QKD in the presence of noise. We present the details of our methods for both prepare-and-measure (BB84) and entanglement-based (BBM92) QKD protocols to demonstrate how they can be combined with various types of common QKD protocols. We have considered applying quantum gates after the noisy channel to recover the damped key qubits and both before and after the noisy channel to prepare and recover the key qubits. We demonstrate the significant reduction in the error rate of the proposed schemes compared to QKD protocols with no protection. Furthermore, to achieve a protection scheme that is independent of the intensity of the noisy channel, we consider applying environment-assisted measurement to the noisy channel, followed by a recovery process via quantum gates, where explicit formula of the protection variable to achieve an error rate of zero is calculated and the corresponding success probability is analyzed. To assess our proposed schemes for BB84 and BBM92 protocols, we analyze three key performance indicators: error rate, QKD success probability, and eavesdropper’s success probability. These metrics provide insights into the effectiveness, correctness, and security of our methods, ensuring reliable and secure quantum communication. [ABSTRACT FROM AUTHOR]

This article explores the relative advantages in continuous‐variable quantum teleportation when non‐Gaussian operations, namely, photon subtraction, addition, and catalysis, are performed before and after interaction with a noisy channel. The resource state for teleporting unknown coherent and squeezed vacuum states is generated using two distinct strategies: i) Implementation of non‐Gaussian operations on two mode squeezed vacuum (TMSV) state before interaction with a noisy channel, ii) Implementation of non‐Gaussian operations after interaction of TMSV state with a noisy channel. The results show that non‐Gaussian operations can enhance teleportation fidelity in a dissipative environment. However, the most advantageous non‐Gaussian operation and appropriate strategy depend on the state and channel parameters. The results suggest that employing such strategies can be advantageous in other non‐Gaussian continuous variable quantum information (QIP) processing tasks in a dissipative environment. [ABSTRACT FROM AUTHOR]

Entanglement protection from noisy environments is an essential task in practical quantum information and communication. In this paper, we investigate the entanglement recovery of an amplitude-damped tripartite GHZ state by a weak-measurement reversal procedure. In particular, we emphasize the key importance of the inequivalency of probability amplitudes of the tripartite system under the recovery technique. We explore the maximal and non-maximal tripartite entangled state scenarios under amplitude damping noise in the absence and presence of weak measurement reversal procedures. Importantly, the non-maximal entangled state turns out to be a good choice for the entanglement recovery via weak-measurement reversal procedure. [ABSTRACT FROM AUTHOR]

Previous work has shown that English native speakers interpret sentences as predicted by a noisy‐channel model: They integrate both the real‐world plausibility of the meaning—the prior—and the likelihood that the intended sentence may be corrupted into the perceived sentence. In this study, we test the noisy‐channel model in Mandarin Chinese, a language taxonomically different from English. We present native Mandarin speakers sentences in a written modality (Experiment 1) and an auditory modality (Experiment 2) in three pairs of syntactic alternations. The critical materials are literally implausible but require differing numbers and types of edits in order to form more plausible sentences. Each sentence is followed by a comprehension question that allows us to infer whether the speakers interpreted the item literally, or made an inference toward a more likely meaning. Similar to previous research on related English constructions, Mandarin participants made the most inferences for implausible materials that could be inferred as plausible by deleting a single morpheme or inserting a single morpheme. Participants were less likely to infer a plausible meaning for materials that could be inferred as plausible by making an exchange across a preposition. And participants were least likely to infer a plausible meaning for materials that could be inferred as plausible by making an exchange across a main verb. Moreover, we found more inferences in written materials than spoken materials, possibly a result of a lack of word boundaries in written Chinese. Overall, the fact that the results were so similar to those found in related constructions in English suggests that the noisy‐channel proposal is robust. [ABSTRACT FROM AUTHOR]

This study investigates the dynamical aspects of quantum correlations under two uses of noisy channels with memory. In this article, considering a family of pure entangled states, we study the quantum correlation in terms of entanglement and measurement-induced nonlocality (MIN) (based on trace distance and fidelity) when the consecutive actions of a quantum channel on the sequence of qubits have partial classical correlations. It is found that the quantum correlations monotonically decrease as the correlation strength increases, which indicates that the correlation measures strongly depend on both the noise parameter and the correlation strength of the channel. The results also illustrate that the memory effects offer more robustness against the considered noise. These findings give us insights into exploiting the resource content of the quantum state to achieve quantum advantages. [ABSTRACT FROM AUTHOR]

In this article, we first propose a deterministic bidirectional quantum teleportation scheme in the framework of general multi-hop network. In the scheme, three-qubit GHZ state and Bell state play the role of shared resources. The shared quantum channel is determined by the parity of the hop number of the communication network. Entanglement swapping of distant participants is accomplished by Bell state measurement and two-qubit measurement. Receivers at each side can recover the target state according to general formulas with one hundred percent. Then, we give the general form of our scheme in noisy environment. The performance of the scheme in four-hop network suffering bit flip noise is presented as an illustrative example. [ABSTRACT FROM AUTHOR]

A two-terminal distributed binary hypothesis testing problem over a noisy channel is studied. The two terminals, called the observer and the decision maker, each has access to n independent and identically distributed samples, denoted by U and V , respectively. The observer communicates to the decision maker over a discrete memoryless channel, and the decision maker performs a binary hypothesis test on the joint probability distribution of (U , V) based on V and the noisy information received from the observer. The trade-off between the exponents of the type I and type II error probabilities is investigated. Two inner bounds are obtained, one using a separation-based scheme that involves type-based compression and unequal error-protection channel coding, and the other using a joint scheme that incorporates type-based hybrid coding. The separation-based scheme is shown to recover the inner bound obtained by Han and Kobayashi for the special case of a rate-limited noiseless channel, and also the one obtained by the authors previously for a corner point of the trade-off. Finally, we show via an example that the joint scheme achieves a strictly tighter bound than the separation-based scheme for some points of the error-exponents trade-off. [ABSTRACT FROM AUTHOR]

IntroductionDuring speech comprehension, multiple sources of information are available to listeners, which are combined to guide the recognition process. Models of speech comprehension posit that when the acoustic speech signal is obscured, listeners rely more on information from other sources. However, these models take into account only word frequency information and local contexts (surrounding syllables), but not sentence-level information. To date, empirical studies investigating predictability effects in noise did not carefully control the tested speech sounds, while the literature investigating the effect of background noise on the recognition of speech sounds does not manipulate sentence predictability. Additionally, studies on the effect of background noise show conflicting results regarding which noise type affects speech comprehension most. We address this in the present experiment.MethodsWe investigate how listeners combine information from different sources when listening to sentences embedded in background noise. We manipulate top-down predictability, type of noise, and characteristics of the acoustic signal, thus creating conditions which differ in the extent to which a specific speech sound is masked in a way that is grounded in prior work on the confusability of speech sounds in noise. Participants complete an online word recognition experiment.Results and discussionThe results show that participants rely more on the provided sentence context when the acoustic signal is harder to process. This is the case even when interactions of the background noise and speech sounds lead to small differences in intelligibility. Listeners probabilistically combine top-down predictions based on context with noisy bottom-up information from the acoustic signal, leading to a trade-off between the different types of information that is dependent on the combination of a specific type of background noise and speech sound.

While Transmission Control Protocol (TCP) works well with a low bit error rate (BER), the performance of TCP degrades significantly if the BER rises above a certain level. A study of the performance of TCP with high BER is required for the efficient design and deployment of such systems. In this paper, we address the problem of TCP performance in high BERs and analyze the issues by investigating the effect of BERs on system performance. We consider TCP Reno in our study to explore the system performance using extensive analysis of simulation and modeling. In the analysis, we consider the amount of datagram sent and retransmitted, mean throughput, link-layer overhead, TCP window size, FTP download response time, packet dropping and retransmission, and the TCP congestion avoidance mechanism. We validate simulation results by setting up a virtualized testbed using Linux hosts and a Linux router. The results obtained show that TCP throughput degrades significantly and eventually collapses at the packet drop probability of 10% (BER = 10−5). The FTP download response time is about 32 times longer than that of a perfect channel (no packet dropping). We found that TCP Reno cannot handle such a high BER to operate in wireless environments effectively. Finally, we provide recommendations for network researchers and engineers confronted with the challenge of operating TCP over noisy channels. [ABSTRACT FROM AUTHOR]

Frequent words tend to be short, and many researchers haveproposed that this relationship reflects a tendency towards ef-ficient communication. Recent work has sought to formalizethis observation in the context of information theory, which es-tablishes a limit on communicative efficiency called the chan-nel capacity. In this paper, I first show that the compositionalstructure of natural language prevents natural language com-munication from getting close to the channel capacity, but thata different limit, which incorporates probability in context,may be achievable. Next, I present two corpus studies in threetypologically-diverse languages that provide evidence that lan-guages change over time towards the achievable limit. Theseresults suggest that natural language optimizes for efficiencyover time, and does so in a way that is appopriate for compo-sitional codes.

Mobile Ad hoc Networks (MANETs) are becoming popular technologies because they offer flexibility in setting up anytime and anywhere, and provide communication support on the go. This communication requires the use of Transmission Control Protocol (TCP) which is not originally designed for use in MANET environments; therefore, it raises serious performance issues. To overcome the deficiency of the original TCP, several modifications have been proposed and reported in the networking literature. TCP-WELCOME (Wireless Environment, Link losses, and Congestion packet loss ModEls) is one of the better TCP variants suitable for MANETs. However, it has been found that this protocol has problems with packet losses because of network congestion as it adopts the original congestion control mechanism of TCP New Reno. We also found that TCP-WELCOME does not perform well in noisy channel conditions in wireless environments. In this paper, we propose a novel loss recovery and differentiation algorithm (called TCP-LoRaD) to overcome the above-mentioned TCP problems. We validate the performance of TCP-LoRaD through an extensive simulation setup using Riverbed Modeler (formerly OPNET). Results obtained show that the proposed TCP-LoRaD offers up to 20% higher throughput and about 15% lower end-to-end delays than the TCP-WELCOME in a noisy channel under medium to high traffic loads. [ABSTRACT FROM AUTHOR]

The concept of quantum secure direct communication (QSDC) is to distribute secure message directly between distant users securely, which is an important branch of quantum information science. The purpose of QSDC is to investigate the large capacity of quantum channels and fast speed of information transmission. However, the fidelity of qubits and the efficiency of QSDC will inevitably be affected by the channel noise and the decoherence of the quantum system. In this work, we focus on the performance of QSDC under different noisy channels, and investigate the evolution of quantum states. By numerically studying the performance for two QSDC protocols, we show the efficiency of information transmission over different noisy channel models. [ABSTRACT FROM AUTHOR]

Structural health monitoring (SHM) has been extensively used in the railway industry, with applications ranging from railway infrastructures to carbody shells. An SHM method that dominates monitoring procedures is Acoustic Emissions (AE). The utilisation of the AE method could use a significantly large amount of data, collected and forwarded to terminal computers using wireless communications. Nowadays, the use of 5G is taking over traditional wireless such as Wi-Fi and 4G telecommunications. However, errors in the transmission due to noisy channels may be experienced. The SHM system may result in the wrong detection of a potential defect in a railway infrastructure with dangerous consequences, such as derailment. Hence, methods for adequately dealing with these errors need to be established, such as Forward Error Correction (FEC) codes. In this paper, we suggest the use of the wireless FEC codes applied to a number of deployed AE devices, in order to perform correction at the transmissions. We investigate the new POLAR codes and compare this method with the Reed-Solomon (RS) codes. We present simulations that the POLAR codes are more efficient with trials using the AFF3CT simulator. [ABSTRACT FROM AUTHOR]

We propose a scheme for deterministic remote preparation of an arbitrary two-qubit state via a relay node. Afterwards, we investigate how the scheme is influenced by the noise type, the initial state to be remotely prepared, and the decoherence rate. We find that the fidelity is symmetrical with the line (λb-f =λp-f =0.5) in bit-flip and phase-flip channels. In addition, the fidelity decreases with the increase of decoherence rate in the amplitude-damping and phase-damping channels. We also compare it with other RSP schemes. Since only Bell pairs work as the quantum channels, it makes our RSP scheme more available and feasible.

Children often interpret first noun phrases (NP1s) as agents, which improves comprehension of actives but hinders passives. While children sometimes withhold the agent‐first bias, the reasons remain unclear. The current study tests the hypothesis that children default to the agent‐first bias as a "best guess" of role assignment when they face uncertainty about sentence properties. Thus, rather than always relying on early‐arriving cues, children can attend to different sentence cues across communicative contexts. To test this account, we manipulated interpretive uncertainty by varying cues to the discourse status of initial arguments (referring to new vs. given entities) and measured interpretation accuracy for active (where the agent‐first bias predicted verb morphology) and passive sentences (where the two conflicted). Across three experiments, we found that children relied on the agent‐first bias more when new discourse entities were signaled by definite NP1s, reference to unmentioned entities, and novel words. This, in turn, led to higher accuracy for actives relative to passives. In contrast, when given entities were implied through pronoun NP1s, reference to mentioned entities, and known words, children avoided the agent‐first bias and instead assigned roles using more reliable but later‐arriving verb morphology. This led to similar comprehension accuracy across constructions. These findings suggest that children simultaneously interpret relations between sentences (e.g., discourse continuity) and within sentences (e.g., role assignment), such that commitments to the former can influence parsing cues for the latter. [ABSTRACT FROM AUTHOR]

A two-terminal distributed binary hypothesis testing problem over a noisy channel is studied. The two terminals, called the observer and the decision maker, each has access to n independent and identically distributed samples, denoted by U and V, respectively. The observer communicates to the decision maker over a discrete memoryless channel, and the decision maker performs a binary hypothesis test on the joint probability distribution of (U,V) based on V and the noisy information received from the observer. The trade-off between the exponents of the type I and type II error probabilities is investigated. Two inner bounds are obtained, one using a separation-based scheme that involves type-based compression and unequal error-protection channel coding, and the other using a joint scheme that incorporates type-based hybrid coding. The separation-based scheme is shown to recover the inner bound obtained by Han and Kobayashi for the special case of a rate-limited noiseless channel, and also the one obtained by the authors previously for a corner point of the trade-off. Finally, we show via an example that the joint scheme achieves a strictly tighter bound than the separation-based scheme for some points of the error-exponents trade-off.

We study the effect of noise due to exogenous information distortions in the context of Bayesian persuasion. We first characterize the optimal signal in the prosecutor-judge game from Kamenica and Gentzkow (2011) with a noisy and strongly symmetric communication channel and show that the sender's payoff increases in the number of messages. This implies that, with exogenous noise, the sender prefers to complicate communication. Then, we establish necessary and sufficient conditions for the sender's payoff to weakly increase in the Blackwell-informativeness of the noise channel when the message space and the channel are binary. The reason why a sender may benefit from additional noise is that a garbling may alter the noise structure. Subsequently, we provide sufficient conditions that extend this result to channels of arbitrary cardinality. Finally, we introduce a procedure of making a communication channel more complex and prove that increased complexity benefits the sender. [ABSTRACT FROM AUTHOR]

Listeners can successfully interpret the intended meaning of an utterance even when it contains errors or other unexpected anomalies. The present work combines an online measure of attention to sentence referents (visual world eye-tracking) with offline judgments of sentence meaning to disclose how the interpretation of anomalous sentences unfolds over time in order to explore mechanisms of non-literal processing. We use a metalinguistic judgment in Experiment 1 and an elicited imitation task in Experiment 2. In both experiments, we focus on one morphosyntactic anomaly (Subject-verb agreement; The key to the cabinets literally *were ...) and one semantic anomaly (Without; Lulu went to the gym without her hat ?off) and show that non-literal referents to each are considered upon hearing the anomalous region of the sentence. This shows that listeners understand anomalies by overwriting or adding to an initial interpretation and that this occurs incrementally and adaptively as the sentence unfolds. [ABSTRACT FROM AUTHOR]

Consider an energy harvesting (EH) sensor that continuously monitors a system and sends time-stamped status update to a destination. The sensor harvests energy from nature and uses it to power its updating operations. The destination keeps track of the system status through the successfully received updates. With the recently introduced information freshness metric “Age of Information” (AoI), our objective is to design optimal online status updating policy to minimize the long-term average AoI at the destination, subject to the energy causality constraint at the sensor. Due to the noisy channel between the sensor and the destination, each transmitted update may be erased with a fixed probability, and the AoI at the destination will be reset to zero only when an update is successfully received. We first consider status updating without feedback available to the sensor and show that the Best-effort Uniform updating (BU) policy is optimal in a broadly defined class of online policies. We then investigate status updating with perfect feedback to the sensor and prove similar optimality of the Best-effort Uniform updating with Retransmission (BUR) policy. In order to prove the optimality of the proposed policies, for each case, we first identify a lower bound on the long-term average AoI among a broad class of online policies, and then construct a sequence of virtual policies to approach the lower bound asymptotically. Since those virtual policies are sub-optimal to the original policy, the original policy is thus optimal. [ABSTRACT FROM AUTHOR]

We study a hypothesis testing problem with a privacy constraint over a noisy channel and derive the performance of optimal tests under the Neyman-Pearson criterion. The fundamental limit of interest is the privacy-utility tradeoff (PUT) between the exponent of the type-II error probability and the leakage of the information source subject to a constant constraint on the type-I error probability. We provide an exact characterization of the asymptotic PUT for any non-vanishing type-I error probability. Our result implies that tolerating a larger type-I error probability cannot improve the PUT. Such a result is known as a strong converse or strong impossibility theorem. To prove the strong converse theorem, we apply the recently proposed technique in (Tyagi and Watanabe, 2020) and further demonstrate its generality. The strong converse theorems for several problems, such as hypothesis testing against independence over a noisy channel (Sreekumar and Gündüz, 2020) and hypothesis testing with communication and privacy constraints (Gilani et al., 2020), are established or recovered as special cases of our result. [ABSTRACT FROM AUTHOR]

Structural health monitoring (SHM) has been extensively used in the railway industry, with applications ranging from railway infrastructures to carbody shells. An SHM method that dominates monitoring procedures is Acoustic Emissions (AE). The utilisation of the AE method could use a significantly large amount of data, collected and forwarded to terminal computers using wireless communications. Nowadays, the use of 5G is taking over traditional wireless such as Wi-Fi and 4G telecommunications. However, errors in the transmission due to noisy channels may be experienced. The SHM system may result in the wrong detection of a potential defect in a railway infrastructure with dangerous consequences, such as derailment. Hence, methods for adequately dealing with these errors need to be established, such as Forward Error Correction (FEC) codes. In this paper, we suggest the use of the wireless FEC codes applied to a number of deployed AE devices, in order to perform correction at the transmissions. We investigate the new POLAR codes and compare this method with the Reed-Solomon (RS) codes. We present simulations that the POLAR codes are more efficient with trials using the AFF3CT simulator.

The “bee-identification problem” was formally defined by Tandon, Tan and Varshney [IEEE Trans. Commun., vol. 67, 2019], and the error exponent was studied. This work extends the results for the “absentee bees” scenario, where a fraction of the bees are absent in the beehive image used for identification. For this setting, we present an exact characterization of the bee-identification error exponent, and show that independent barcode decoding is optimal, i.e., joint decoding of the bee barcodes does not result in a better error exponent relative to independent decoding of each noisy barcode. This is in contrast to the result without absentee bees, where joint barcode decoding results in a significantly higher error exponent than independent barcode decoding. We also define and characterize the ‘capacity’ for the bee-identification problem with absentee bees, and prove a strong converse for the same. [ABSTRACT FROM AUTHOR]

The explosion of the number of low-power devices in the next decades calls for a re-thinking of wireless network design, namely, unifying wireless transmission of information and power so as to make the best use of the RF spectrum, radiation, and infrastructure for the dual purpose of communicating and energizing. This article provides a novel learning-based approach towards such wireless network design. To that end, a parametric model of a practical energy harvester, accounting for various sources of nonlinearities, is proposed using a nonlinear regression algorithm applied over collected real data. Relying on the proposed model, the learning problem of modulation design for Simultaneous Wireless Information-Power Transmission (SWIPT) over a point-to-point link is studied. Joint optimization of the transmitter and the receiver is implemented using Neural Network (NN)-based autoencoders. The results reveal that by increasing the receiver power demand, the baseband transmit modulation constellation converges to an On-Off keying signalling. Utilizing the observations obtained via learning, an algorithmic SWIPT modulation design is proposed. It is observed via numerical results that the performance loss of the proposed modulations are negligible compared to the ones obtained from learning. Extension of the studied problem to learning modulation design for multi-user SWIPT scenarios and coded modulation design for point-to-point SWIPT are considered. The major conclusion of this work is to utilize learning-based results to design non learning-based algorithms, which perform as well. In particular, inspired by the results obtained via learning, an algorithmic approach for coded modulation design is proposed, which performs very close to its learning counterparts, and is significantly superior due to its high real-time adaptability to new system design parameters. [ABSTRACT FROM AUTHOR]

A distributed binary hypothesis testing (HT) problem involving two parties, one referred to as the observer and the other as the detector is studied. The observer observes a discrete memoryless source (DMS) and communicates its observations to the detector over a discrete memoryless channel (DMC). The detector observes another DMS correlated with that at the observer, and performs a binary hypothesis test on the joint distribution of the two DMS’s using its own observed data and the information received from the observer. The trade-off between the type I error probability and the type II error-exponent of the HT is explored. Single-letter lower bounds on the optimal type II error-exponent are obtained by using two different coding schemes, a separate HT and channel coding scheme and a joint HT and channel coding scheme based on hybrid coding for the matched bandwidth case. Exact single-letter characterization of the same is established for the special case of testing against conditional independence, and it is shown to be achieved by the separate HT and channel coding scheme. An example is provided where the joint scheme achieves a strictly better performance than the separation based scheme. [ABSTRACT FROM AUTHOR]

Consider the problem of identifying a massive number of bees, uniquely labeled with barcodes, using noisy measurements. We formally introduce this “bee-identification problem”, define its error exponent, and derive efficiently computable upper and lower bounds for this exponent. We show that joint decoding of barcodes provides a significantly better exponent compared to separate decoding followed by permutation inference. For low rates, we prove that the lower bound on the bee-identification exponent obtained using typical random codes (TRC) is strictly better than the corresponding bound obtained using a random code ensemble (RCE). Further, as the rate approaches zero, we prove that the upper bound on the bee-identification exponent meets the lower bound obtained using TRC with joint barcode decoding. [ABSTRACT FROM AUTHOR]

Existing work shows that readers often interpret grammatical errors (e.g., The key to the cabinets *were shiny) and sentence-level blends ("without-blend": Claudia left without her headphones *off) in a non-literal fashion, inferring that a more frequent or more canonical utterance was intended instead. This work examines how interlocutor identity affects the processing and interpretation of anomalous sentences. We presented anomalies in the context of "emails" attributed to various writers in a self-paced reading paradigm and used comprehension questions to probe how sentence interpretation changed based upon properties of the item and properties of the "speaker." Experiment 1 compared standardised American English speakers to L2 English speakers; Experiment 2 compared the same standardised English speakers to speakers of a non-Standardised American English dialect. Agreement errors and without-blends both led to more non-literal responses than comparable canonical items. For agreement errors, more non-literal interpretations also occurred when sentences were attributed to speakers of Standardised American English than either non-Standardised group. These data suggest that understanding sentences relies on expectations and heuristics about which utterances are likely. These are based upon experience with language, with speaker-specific differences, and upon more general cognitive biases. [ABSTRACT FROM AUTHOR]