Underwater optical wireless communications in swarm robotics: A tutorial

PA Hoeher, J Sticklus, A Harlakin - … Communications Surveys & …, 2021 - ieeexplore.ieee.org
Underwater swarm robotics is an emerging topic. Compared to individual autonomous
vehicles, high-capacity communication links are required between the mobile agents. In this …

[图书][B] Information theory, inference and learning algorithms

DJC MacKay - 2003 - books.google.com
Information theory and inference, often taught separately, are here united in one entertaining
textbook. These topics lie at the heart of many exciting areas of contemporary science and …

Fountain codes

DJC MacKay - IEE Proceedings-Communications, 2005 - IET
Fountain codes are record-breaking sparse-graph codes for channels with erasures, such
as the internet, where files are transmitted in multiple small packets, each of which is either …

Network coding: an instant primer

C Fragouli, JY Le Boudec, J Widmer - ACM SIGCOMM Computer …, 2006 - dl.acm.org
Network coding is a new research area that may have interesting applications in practical
networking systems. With network coding, intermediate nodes may send out packets that are …

Low-density parity-check codes and their rateless relatives

N Bonello, S Chen, L Hanzo - IEEE Communications Surveys & …, 2010 - ieeexplore.ieee.org
This survey guides the reader through the extensive open literature that is covering the
family of low-density parity-check LDPC codes and their rateless relatives. In doing so, we …

On coding for reliable communication over packet networks

DS Lun, M Médard, R Koetter, M Effros - Physical Communication, 2008 - Elsevier
We consider the use of random linear network coding in lossy packet networks. In particular,
we consider the following simple strategy: nodes store the packets that they receive and …

On-the-fly verification of rateless erasure codes for efficient content distribution

MN Krohn, MJ Freedman… - IEEE Symposium on …, 2004 - ieeexplore.ieee.org
The quality of peer-to-peer content distribution can suffer when malicious participants
intentionally corrupt content. Some systems using simple block-by-block downloading can …

Network coding meets TCP: Theory and implementation

JK Sundararajan, D Shah, M Médard… - Proceedings of the …, 2011 - ieeexplore.ieee.org
The theory of network coding promises significant benefits in network performance,
especially in lossy networks and in multicast and multipath scenarios. To realize these …

Raptor codes on binary memoryless symmetric channels

O Etesami, A Shokrollahi - IEEE Transactions on Information …, 2006 - ieeexplore.ieee.org
In this paper, we will investigate the performance of Raptor codes on arbitrary binary input
memoryless symmetric channels (BIMSCs). In doing so, we generalize some of the results …

Minimum-cost multicast over coded packet networks

DS Lun, N Ratnakar, M Médard… - … on information theory, 2006 - ieeexplore.ieee.org
We consider the problem of establishing minimum-cost multicast connections over coded
packet networks, ie, packet networks where the contents of outgoing packets are arbitrary …