1 citations · 3 across the 3 of their papers we have counts for
4 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,…
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…