English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

It has recently been pointed out in both of the works [C. Shanguan, Y. Zhang,and G. Ge, {\em IEEE Trans. Inform. Theory}, 64(8):5755-5766 (2018)] and [Q.Yan, X. Tang, Q. Chen, and M. Cheng, {\em IEEE Commun. Lett.}, 22(2):236-239(2018)] that placement delivery arrays (PDAs), as coined in [Q. Yan, M. Cheng,X. Tang, and Q. Chen, {\em IEEE Trans. Inform. Theory}, 63(9):5821-5833(2017)], are equivalent to strong edge colorings of bipartite graphs. In thispaper we consider various methods of combining two or more strong edgecolorings of bipartite graphs to obtain new ones, and therefore new PDAs.Combining PDAs in certain ways also gives a framework for obtaining PDAs withmore robust and flexible parameters. We investigate how the parameters ofcertain strong edge colorings change after being combined with others and,after comparing the parameters of the resulting PDAs with those of the initialones, find that subpacketization levels thusly can often be improved.

Placement Delivery Arrays from Combinations of Strong Edge Colorings