163 search results - page 8 / 33 » Concatenated codes can achieve list-decoding capacity |
ISCC
2003
IEEE
13 years 12 months ago
2003
IEEE
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
INFOCOM
2005
IEEE
14 years 9 days ago
2005
IEEE
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
- A novel iteratively detected Sphere Packing (SP) modulation aided Orthogonal Frequency Division Multiplexing (OFDM) scheme is proposed, which we refer to as the SPOFDM arrangemen...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary timeinvariant function of the channel output samples is consider...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...