activity
20102025
most citedThroughput and Latency in Finite-Buffer Line Networks

25 citations · 94 across the 22 of their papers we have counts for

collaborators
Showing cs.ITShow all

23 papers · 1 filter

cs.IT2025

Performance Bounds on Pliable Index Coding Using Absent Receivers

Lawrence Ong, Badri N. Vellambi, Parastoo Sadeghi +1

We characterise bounds on the optimal broadcast rate for a few classes of pliable-index-coding instances. Unlike the majority of currently solved instances, which belong to a speci…

cs.IT2024

Group Complete- Pliable Index Coding

Sina Eghbal, Badri N. Vellambi, Lawrence Ong +1

This paper introduces a novel class of PICOD() problems referred to as -group complete- PICOD() problems. It constructs a multi-stage achievability scheme to generate p…

cs.IT2023

Preferential Pliable Index Coding

Daniel Byrne, Lawrence Ong, Parastoo Sadeghi +1

We propose and study a variant of pliable index coding (PICOD) where receivers have preferences for their unknown messages and give each unknown message a preference ranking. We ca…

cs.IT2022

Very Pliable Index Coding

Lawrence Ong, Badri N. Vellambi

In the pliable variant of index coding, receivers are allowed to decode any new message not known a priori. Optimal code design for this variant involves identifying each receiver'…

cs.IT2019

Improved Lower Bounds for Pliable Index Coding using Absent Receivers

Lawrence Ong, Badri N. Vellambi, Jörg Kliewer +1

This paper studies pliable index coding, in which a sender broadcasts information to multiple receivers through a shared broadcast medium, and the receivers each have some message…

cs.IT2019★ 13 cited

Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers

Lawrence Ong, Badri N. Vellambi, Jörg Kliewer

We characterise the optimal broadcast rate for a few classes of pliable-index-coding problems. This is achieved by devising new lower bounds that utilise the set of absent receiver…