5 citations · 12 across the 8 of their papers we have counts for
8 papers
Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels
Lóránt Farkas
An asynchronous multiple access error exponent result implicates a new result for time invariant trellis codes of memory 1.
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…
Building Block Components to Control a Data Rate in the Apache Hadoop Compute Platform
Tien Van Do, Binh T. Vu, Nam H. Do +3
Resource management is one of the most indispensable components of cluster-level infrastructure layers. Users of such systems should be able to specify their job requirements as a…
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…
Blind decoding of Linear Gaussian channels with ISI, capacity, error exponent, universality
Lóránt Farkas
A new straightforward universal blind detection algorithm for linear Gaussian channel with ISI is given. A new error exponent is derived, which is better than Gallager's random cod…
Reaching the Holevo Capacity via von Neumann measurement, and its use
L. Farkas
In this article we show that the Holevo capacity of a classical quantum channel, can be reached not only by a POVM but by von Neumann measurement too. Furthermore we show two use o…