374 search results - page 12 / 75 » On Communicating Automata with Bounded Channels |
DSD
2008
IEEE
13 years 9 months ago
2008
IEEE
We discuss the issue of reliable transmission of bounded streams of data samples over simple wireless channels offered by low-end RF modules. Traditional solutions, i.e., window-b...
ICT
2004
Springer
14 years 24 days ago
2004
Springer
— In this paper we determine bounds of the capacity region of a two-user multipleaccess channel with Rayleigh fading when neither the transmitters nor the receiver has channel st...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
SERVICES
2008
13 years 8 months ago
2008
an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via chan...
TIT
2002
13 years 7 months ago
2002
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...