Lan Truong

Dr. Lan Truong

University of Cambridge
orcid

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 January 2017 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Lan TruongLan Truong
Lan Truong
SFSilas Fong
Silas Fong
VTVincent Tan
Vincent Tan
In this paper, we consider single-and multi-user Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities. In the first of two contributions, we study asymptotic expansions for the additive white Gaussian noise (AWGN) channel with feedback under the average error probability formalism. By drawing ideas from Gallager and Nakiboǧlu's work for the direct part and the meta-converse for the converse part, we establish the e-capacity and show that it depends on e in general and so the strong converse fails to hold. Furthermore, we provide bounds on the second-order term in the asymptotic expansion. We show that for any positive integer L, the second-order term is bounded between a term proportional to - ln(L) n (where ln(L)(·) is the L-fold nested logarithm function) and a term proportional to +(n ln n)1/2, where n is the blocklength. The lower bound on the second-order term shows that feedback does provide an improvement in the maximal achievable rate over the case where no feedback is available. In our second contribution, we establish the e-capacity region for the AWGN multiple access channel with feedback under the expected power constraint by combining ideas from hypothesis testing, information spectrum analysis, Ozarow's coding scheme, and power control.

23 November 2020 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Open access
Lan TruongLan Truong
Lan Truong
MAMatthew Aldridge
Matthew Aldridge
Jonathan ScarlettJonathan Scarlett
Jonathan Scarlett
In this paper, we study the problem of non-adaptive group testing, in which one seeks to identify which items are defective given a set of suitably-designed tests whose outcomes indicate whether or not at least one defective item was included in the test. The most widespread recovery criterion seeks to exactly recover the entire defective set, and relaxed criteria such as approximate recovery and list decoding have also been considered. In this paper, we study the fundamental limits of group testing under the significantly relaxed weak recovery criterion, which only seeks to identify a small fraction (e.g., 0.01) of the defective items. Given the near-optimality of i.i.d. Bernoulli testing for exact recovery in sufficiently sparse scaling regimes, it is natural to ask whether this design additionally succeeds with much fewer tests under weak recovery. Our main negative result shows that this is not the case, and in fact, under i.i.d. Bernoulli random testing in the sufficiently sparse regime, an all-or-nothing phenomenon occurs: When the number of tests is slightly below a threshold, weak recovery is impossible, whereas when the number of tests is slightly above the same threshold, high-probability exact recovery is possible. In establishing this result, we additionally prove similar negative results under Bernoulli designs for the weak detection problem (distinguishing between the group testing model vs. completely random outcomes) and the problem of identifying a single item that is definitely defective. On the positive side, we show that all three relaxed recovery criteria can be attained using considerably fewer tests under suitably-chosen non-Bernoulli designs. Thus, our results collectively indicate that when too few tests are available, naively applying i.i.d. Bernoulli testing can lead to catastrophic failure, whereas “cutting one’s losses” and adopting a more carefully-chosen design can still succeed in attaining these less stringent criteria.

15 January 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Lan TruongLan Truong
Lan Truong
VTVincent Tan
Vincent Tan
We characterize the fundamental limits of transmission of information over a Gaussian multiple access channel (MAC) with the use of variable-length feedback codes and under a non-vanishing error probability formalism. We develop new achievability and converse techniques to handle the continuous nature of the channel and the presence of expected power constraints. We establish the ε-capacity regions and bounds on the second-order asymptotics of the Gaussian MAC with variable-length feedback with termination (VLFT) codes and stop-feedback codes. We show that the former outperforms the latter significantly. Due to the multi-terminal nature of the channel model, we leverage tools from renewal theory developed by Lai and Siegmund to bound the asymptotic behavior of the maximum of a finite number of stopping times.

5 September 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Lan TruongLan Truong
Lan Truong
Giuseppe CoccoGiuseppe Cocco
Giuseppe Cocco
JFJosep Font-Segura
Josep Font-Segura
AFAlbert Guillen i Fabregas
Albert Guillen i Fabregas
This paper shows that, for discrete memoryless channels, the error exponent of a randomly generated code with independent codewords converges in probability to its expectation—the typical error exponent. For high rates, the result follows from the fact that the random-coding error exponent and the sphere-packing error exponent coincide. For low rates, instead, the convergence is based on the fact that the union bound accurately characterizes the error probability. The paper also zooms into the behavior at asymptotically low rates, and shows that the normalized error exponent converges in distribution to the standard Gaussian or a Gaussian-like distribution. We also state several results on the convergence of the error probability and error exponent for generic ensembles and channels.

14 October 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Lan TruongLan Truong
Lan Truong
Jonathan ScarlettJonathan Scarlett
Jonathan Scarlett
The support recovery problem consists of determining a sparse subset of variables that is relevant in generating a set of observations. In this paper, we study the support recovery problem in the phase retrieval model consisting of noisy phaseless measurements, which arises in a diverse range of settings such as optical detection, X-ray crystallography, electron microscopy, and coherent diffractive imaging. Our focus is on information-theoretic fundamental limits under an approximate recovery criterion, considering both discrete and Gaussian models for the sparse non-zero entries, along with Gaussian measurement matrices. In both cases, our bounds provide sharp thresholds with near-matching constant factors in several scaling regimes on the sparsity and signal-to-noise ratio. As a key step towards obtaining these results, we develop new concentration bounds for the conditional information content of log-concave random variables, which may be of independent interest.

15 April 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Lan TruongLan Truong
Lan Truong
VTVincent Tan
Vincent Tan
We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be equal to {0,B(1 - R(D)/C)}, where R(D) is the rate-distortion function of the source, B is the maximum relative entropy between output distributions of the DMC, and C is the Shannon capacity of the channel. We show that in this asymptotic regime, separate source-channel coding is, in fact, optimal.