—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
— Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at ...
Recently, multicarrier modulation in the form of orthogonal frequency division multiplexing (OFDM) has been shown feasible for underwater acoustic communications via effective algo...
Abstract--BitTorrent is the most popular file sharing protocol on the Internet. It is proved that its performance are nearoptimal for generic file distribution when the overlay is ...
Salvatore Spoto, Rossano Gaeta, Marco Grangetto, M...