Search with noisy and delayed response

DOI10.1016/j.endm.2005.07.013zbMath1158.94325OpenAlexW2045384253MaRDI QIDQ3439235

Ning Cai

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.07.013

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
• Exponential error bounds for random codes in the arbitrarily varying channel
• The capacity of the arbitrarily varying channel revisited: positivity, constraints
• Zero error capacity under list decoding
• Identification in the presence of feedback-a discovery of new capacity formulas
• Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
• On the Probability of Buffer Overflow Under an Arbitrary Bounded Input-Output Distribution
• Elimination of correlation in random codes for arbitrarily varying channels
• Common randomness in information theory and cryptography. II. CR capacity
• Channel capacities for list codes
• Buffer overflow in variable length coding of fixed rate sources
• Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback

This page was built for publication: Search with noisy and delayed response