Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis-Reference-Cited by-同舟云学术

Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis

Author:

Su Pin-Wen¹^ORCID,Huang Yu-Chih²^ORCID,Lin Shih-Chun³^ORCID,Wang I-Hsiang³^ORCID,Wang Chih-Chun¹^ORCID

Affiliation:

1. Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA

2. Institute of Communications Engineering, National Yang Ming Chiao Tung University, Hsinchu, Taiwan

3. Department of Electrical Engineering, Graduate Institute of Communication Engineering, National Taiwan University, Taipei, Taiwan

Funder

NSF

Ministry of Science and Technology (MOST), Taiwan

National Taiwan University

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

Reference25 articles.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Near-Optimal Streaming Codes with Linear Field Size;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

3. Explicit Information-Debt-Optimal Streaming Codes With Small Memory;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25