Maximum Decoding Clique Based Maximum Weight Vertex Search Algorithm for Buffered Instantly Decodable Network Codes
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2021.3129519
Abstract: The traditional instantly decodable network coding (IDNC) schemes discard the non-instantly decodable packets (NIDPs), which results in the loss of useful information. In this letter, we consider a network coding scheme named as buffered instantly… read more here.
Keywords: maximum decoding; network; clique; instantly decodable ... See more keywords
Improving Multicast Networks Throughput via Joint Multicast Beamforming and Rate Aware Instantly Decodable Network Coding
Sign Up to like & getrecommendations! Published in 2025 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2025.3543587
Abstract: The throughput of multicast networks depends not only on the transmission rate, but also on the number of receivers simultaneously served by the transmit signal. In this letter, we develop a cross-layer approach based on… read more here.
Keywords: multicast beamforming; rate; rate aware; network ... See more keywords
Minimizing the Average Packet Access Time of the Application Layer for Buffered Instantly Decodable Network Coding
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Parallel and Distributed Systems"
DOI: 10.1109/tpds.2023.3237989
Abstract: In B-IDNC (buffered instantly decodable network coding), each receiver can cache the non-instantly decodable network coded packets (NIDPs) which contain two wanted packets of the network layer for subsequent network decoding, so that more packets… read more here.
Keywords: network; decodable network; layer; instantly decodable ... See more keywords