activity
20102021
most citedThe Single-Uniprior Index-Coding Problem: The Single-Sender Case and The Multi-Sender Extension

75 citations · 104 across the 8 of their papers we have counts for

collaborators

8 papers

cs.LG2021★ 1 cited

Order Constraints in Optimal Transport

Fabian Lim, Laura Wynter, Shiau Hong Lim

Optimal transport is a framework for comparing measures whereby a cost is incurred for transporting one measure to another. Recent works have aimed to improve optimal transport pla…

cs.IT2014★ 75 cited

The Single-Uniprior Index-Coding Problem: The Single-Sender Case and The Multi-Sender Extension

Lawrence Ong, Chin Keong Ho, Fabian Lim

Index coding studies multiterminal source-coding problems where a set of receivers are required to decode multiple (possibly different) messages from a common broadcast, and they e…

cs.IT2013★ 6 cited

The Multi-Sender Multicast Index Coding

Lawrence Ong, Fabian Lim, Chin Keong Ho

We focus on the following instance of an index coding problem, where a set of receivers are required to decode multiple messages, whilst each knows one of the messages a priori. In…

cs.IT2012★ 2 cited

On U-Statistics and Compressed Sensing II: Non-Asymptotic Worst-Case Analysis

Fabian Lim, Vladimir Stojanovic

In another related work, U-statistics were used for non-asymptotic "average-case" analysis of random compressed sensing matrices. In this companion paper the same analytical tool i…

cs.IT2012★ 19 cited

On U-Statistics and Compressed Sensing I: Non-Asymptotic Average-Case Analysis

Fabian Lim, Vladimir Marko Stojanovic

Hoeffding's U-statistics model combinatorial-type matrix parameters (appearing in CS theory) in a natural way. This paper proposes using these statistics for analyzing random compr…

cs.DS2012★ 1 cited

Two Embedding Theorems for Data with Equivalences under Finite Group Action

Fabian Lim

There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be consi…

cs.IT2012

Linear Programming Upper Bounds on Permutation Code Sizes From Coherent Configurations Related to the Kendall Tau Distance Metric

Fabian Lim, Manabu Hagiwara

Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal…

cs.IT2010

Reliability Distributions of Truncated Max-log-map (MLM) Detectors Applied to ISI Channels

Fabian Lim, Aleksandar Kavcic

The max-log-map (MLM) receiver is an approximated version of the well-known, Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. The MLM algorithm is attractive due to its implementation si…