Variable-rate linear network coding

Authors:
Silas L. Fong;Raymond W. Yeung
Affiliations:
Department of Information Engineering, The Chinese University of Hong Kong, N.T., Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, N.T., Hong Kong
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 7
Cited 0

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Information Theory and Network Coding

Information Theory and Network Coding
Computer Networking: A Top-Down Approach

Computer Networking: A Top-Down Approach
Distributed source coding for satellite communications

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

We introduce variable-rate linear network coding for single-source finite acyclic network. In this problem, the source of a network transmits messages at different rates in different time sessions and every nonsource node in the network decodes the messages if possible. We propose two efficient algorithms for implementing variable-rate linear network coding under different circumstances.