1579 search results - page 107 / 316 » On the Constructions of Constant-Weight Codes |
CORR
2007
Springer
14 years 10 months ago
2007
Springer
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
—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...
JSAC
2008
14 years 10 months ago
2008
Recently, multicarrier modulation in the form of orthogonal frequency division multiplexing (OFDM) has been shown feasible for underwater acoustic communications via effective algo...
TIT
2008
14 years 9 months ago
2008
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...
117
click to vote
VTC
2010
IEEE
14 years 8 months ago
2010
IEEE
— Adaptive network coded cooperation (ANCC) has been proposed as an effective scheme to combine network and channel coding for cooperative wireless networks by matching network-o...