ORCID Profile
0000-0001-7109-5308
Current Organisation
The University of Newcastle
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Coding and Information Theory | Wireless Communications | Data Format | Communications Technologies | Satellite Communications
Mobile Data Networks and Services | Expanding Knowledge in Engineering | Fixed Line Data Networks and Services | Videoconference Services |
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2015
Publisher: MDPI AG
Date: 23-03-2017
DOI: 10.3390/E19040138
Publisher: Elsevier BV
Date: 2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2014
Publisher: IEEE
Date: 10-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2019
Publisher: IEEE
Date: 06-2012
Publisher: IEEE
Date: 06-2015
Publisher: IEEE
Date: 11-2014
Publisher: IEEE
Date: 07-2011
Publisher: IEEE
Date: 07-2019
Publisher: IEEE
Date: 12-07-2021
Publisher: IOP Publishing
Date: 02-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2013
Publisher: IEEE
Date: 07-2006
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2017
Publisher: IEEE
Date: 06-2020
Publisher: IEEE
Date: 06-2009
Publisher: IEEE
Date: 06-2018
Publisher: IEEE
Date: 06-2010
Publisher: IEEE
Date: 08-2019
Publisher: Wiley
Date: 13-08-2014
DOI: 10.1002/ETT.2561
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2022
Publisher: IEEE
Date: 12-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2012
Publisher: IEEE
Date: 12-2017
Publisher: IEEE
Date: 06-2007
Publisher: IEEE
Date: 12-2008
Publisher: IEEE
Date: 11-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2016
Publisher: IEEE
Date: 07-2016
Publisher: IEEE
Date: 26-06-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2013
Publisher: IEEE
Date: 06-2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2007
Publisher: IEEE
Date: 06-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2010
Publisher: IEEE
Date: 06-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2019
Publisher: IEEE
Date: 09-2008
Publisher: IEEE
Date: 10-2016
Publisher: IEEE
Date: 06-2015
Publisher: IEEE
Date: 07-2016
Publisher: IEEE
Date: 2009
Publisher: IEEE
Date: 26-06-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2011
Publisher: IEEE
Date: 17-10-2021
Publisher: Elsevier BV
Date: 08-2007
Publisher: IEEE
Date: 11-2014
Publisher: IEEE
Date: 06-2010
Publisher: IEEE
Date: 06-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: ETH Zurich
Date: 2020
Publisher: IEEE
Date: 11-2018
Publisher: IEEE
Date: 2005
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2012
Publisher: IEEE
Date: 03-2011
DOI: 10.1109/DCC.2011.70
Publisher: IEEE
Date: 12-2017
Publisher: IEEE
Date: 11-2010
Publisher: IEEE
Date: 11-2010
Publisher: IEEE
Date: 07-2011
Publisher: IEEE
Date: 03-2011
DOI: 10.1109/DCC.2011.32
Publisher: IEEE
Date: 10-2012
Publisher: IEEE
Date: 06-2015
Publisher: Wiley
Date: 11-08-2011
DOI: 10.1002/ETT.1492
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2017
Publisher: IEEE
Date: 07-2006
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2017
Publisher: IEEE
Date: 06-2017
Publisher: IEEE
Date: 12-2017
Publisher: IEEE
Date: 07-2012
Publisher: IEEE
Date: 07-2012
Publisher: IEEE
Date: 07-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2017
Publisher: IEEE
Date: 17-10-2021
Publisher: IEEE
Date: 07-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2008
Publisher: IEEE
Date: 06-2014
Publisher: IEEE
Date: 06-2014
Publisher: MDPI AG
Date: 21-06-2019
DOI: 10.3390/E21060615
Abstract: This paper studies index coding with two senders. In this setup, source messages are distributed among the senders possibly with common messages. In addition, there are multiple receivers, with each receiver having some messages a priori, known as side-information, and requesting one unique message such that each message is requested by only one receiver. Index coding in this setup is called two-sender unicast index coding (TSUIC). The main goal is to find the shortest aggregate normalized codelength, which is expressed as the optimal broadcast rate. In this work, firstly, for a given TSUIC problem, we form three independent sub-problems each consisting of the only subset of the messages, based on whether the messages are available only in one of the senders or in both senders. Then, we express the optimal broadcast rate of the TSUIC problem as a function of the optimal broadcast rates of those independent sub-problems. In this way, we discover the structural characteristics of TSUIC. For the proofs of our results, we utilize confusion graphs and coding techniques used in single-sender index coding. To adapt the confusion graph technique in TSUIC, we introduce a new graph-coloring approach that is different from the normal graph coloring, which we call two-sender graph coloring, and propose a way of grouping the vertices to analyze the number of colors used. We further determine a class of TSUIC instances where a certain type of side-information can be removed without affecting their optimal broadcast rates. Finally, we generalize the results of a class of TSUIC problems to multiple senders.
Location: United Kingdom of Great Britain and Northern Ireland
Start Date: 03-2012
End Date: 03-2015
Amount: $375,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2015
End Date: 07-2024
Amount: $656,967.00
Funder: Australian Research Council
View Funded ActivityStart Date: 04-2019
End Date: 06-2022
Amount: $420,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2015
End Date: 12-2018
Amount: $355,100.00
Funder: Australian Research Council
View Funded Activity