5 citations · 9 across the 4 of their papers we have counts for
4 papers
Error Exponents for Asynchronous Multiple Access Channels. Controlled Asynchronism may Outperform Synchronism
Lóránt Farkas, Tamás Kói
Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders,…
Universal Random Access Error Exponents for Codebooks of Different Word-Lengths
Lóránt Farkas, Tamás Kói
Csiszár's channel coding theorem for multiple codebooks is generalized allowing the codeword lenghts differ across codebooks. Also in this case, for each codebook an error exponent…
Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels
Lóránt Farkas, Tamás Kói
A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel…
On Capacity Regions of Discrete Asynchronous Multiple Access Channels
Lóránt Farkas, Tamás Kói
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexpl…