Department of Electrical Engineering, National Taipei University of Technology find us on facebook(將另開視窗)
Search this site | set the webpage to BLUE style set the webpage to ORANGE style set the webpage to GREEN style set the webpage to PURPLE style set the webpage to GRAY style ENLARGE the webpage | Site Map | Home | 中文(Chinese)
Home > People > Staff > Yi-Sheng Su > Publication ::: Background | Publication
::: Yi-Sheng Su
A. Journal Papers
1. Y.-S. Su, “Optimal pliable fractional repetition codes that are locally recoverable: A bipartite graph approach,” IEEE Transactions on Information Theory, vol. 65. no. 2, pp 985–999, Feb. 2019.
2. Y.-S. Su, “Pliable fractional repetition codes for distributed storage systems: Design and analysis,” IEEE Transactions on Communications, vol. 66, no. 6, pp. 2359–2375, Jun. 2018.
3. Y.-S. Su, “On the construction of local parities for (r, t)-availability in distributed storage,” IEEE Transactions on Communications, vol. 65, no. 6, pp. 2332–2344, Jun. 2017.
4. Y.-S. Su, “On optimal constructions of a class of binary locally repairable codes with multiple repair groups,” IEEE Access, vol. 5, pp. 3524–3528, 2017.
5. Y.-S. Su, “A note on topology-transparent scheduling via the Chinese remainder theorem,” IEEE Signal Processing Letters, vol. 23, vol. 8, pp. 1126–1130, Aug. 2016.
6. Y.-S. Su and C.-H. Wang, “Design and analysis of unequal missing protection for the grouping of RFID tags,” IEEE Transactions on Communications, vol. 63, no. 11, pp. 4471–4489, Nov. 2015.
7. Y.-S. Su, “Topology-transparent scheduling via the Chinese remainder theorem,” IEEE/ACM Transactions on Networking, vol. 23, no. 5, pp. 1416–1429, Oct. 2015.
8. Y.-S. Su, “Extended grouping of RFID tags based on resolvable transversal designs,” IEEE Signal Processing Letters, vol. 21, vol. 4, pp. 488–492, Apr. 2014.
9. Y.-S. Su, S.-L. Su, and J.-S. Li, “Joint topology-transparent scheduling and QoS routing in ad hoc networks,” IEEE Transactions on Vehicular Technology, vol. 63, no. 1, pp. 372–389, Jan. 2014.
10. Y.-S. Su and O. K. Tonguz, “Using the Chinese remainder theorem for the grouping of RFID tags,” IEEE Transactions on Communications, vol. 61, no. 11, pp. 4741–4753, Nov. 2013.
11. Y.-S. Su, J.-R. Lin, and O. K. Tonguz, “Grouping of RFID tags via strongly selective families,” IEEE Communications Letters, vol. 17, no. 6, pp. 1120-1123, Jun. 2013.
12. Y.-S. Su and O. K. Tonguz, “Robust design of two-dimensional optical reference signals against diffraction effects,” IEEE/OSA Journal of Lightwave Technology, vol. 30, no. 13, pp. 2168-2175, Jul. 2012.
13. Y.-S. Su, T.-C. Wu, C.-H. Wang, and M.-K. Chang, “Generation of two-dimensional optical ref- erence signals based on parametric minimum cross entropy,” IEEE Photonics Technology Letters, vol. 23, no. 12, pp. 813–815, Jun. 2011.
14. Y.-S. Su, S.-L. Su, and J.-S. Li, “Topology-independent link activation scheduling schemes for mobile CDMA ad hoc networks,” IEEE Transactions Mobile Computing, vol. 7, no. 5, pp. 599–616, May 2008.
B. Conference Papers
1. Y.-S. Su and C.-H. Wang, “Constructions of optimal locally recoverable fractional repetition codes via masking,” poster presentation in 2019 IEEE ISIT, Jul. 2019.
2. Y.-S. Su, “Optimal pliable fractional repetition codes,” in Proc. 2018 IEEE ISIT, Jun. 2018, pp. 2077-2081.
3. Y.-S. Su, “On locally recoverable fractional repetition codes,” poster presentation in Proc. 2018 IZS, Feb. 2018.
4. Y.-S. Su, “Constructions of fractional repetition codes with flexible per-node storage and repetition degree,” in Proc. 2017 IEEE GLOBECOM, Dec. 2017, pp. 1-6.
5. Y.-S. Su, “Design of membership matrices for (r, t)-availability in distributed storage,” in Proc. 2016 IEEE ISIT, Jul. 2016, pp. 998-1002.
6. Y.-S. Su and C.-H. Wang, “On unequal missing protection of the grouping of RFID tags,” in Proc. 2015 IEEE ISIT, Jun. 2015, pp. 2994–2998.
Copyright © 2020 Department of Electrical Engineering, Taipei Tech. All Rights Reserved.
Address: No. 1, Sec. 3, Chung-Hsiao E. Rd., Taipei 106, Taiwan, Republic of China
Tel:+886-2-27712171 Ext.2100 Fax:+886-2-27317187
1851023 Visits since May 26, 2003