Capacity-achieving codes for finite-state channels with maximum-likelihood decoding
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Fundamental performance limits of communications systems impaired by impulse noise
IEEE Transactions on Communications
On reliable communications over channels impaired by bursty impulse noise
IEEE Transactions on Communications
Coherent continuous-phase frequency-shift keying: parameter optimization and code design
IEEE Transactions on Wireless Communications
Spectrally-efficient continuous phase modulations
IEEE Transactions on Wireless Communications
Optimization of information rate upper and lower bounds for channels with memory
IEEE Transactions on Information Theory
Constrained capacities for faster-than-Nyquist signaling
IEEE Transactions on Information Theory
Ordering finite-state Markov channels by mutual information
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On destructive superposition of shaping pulses in band-limited linear modulation systems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Capacity-achieving codes for channels with memory with maximum-likelihood decoding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Time-frequency packing for linear modulations: spectral efficiency and practical detection schemes
IEEE Transactions on Communications
Optical impulse modulation for indoor diffuse wireless communications
IEEE Transactions on Communications
Multi-rate continuous phase modulations for Gaussian broadcast channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Coding for a bit-shift channel with applications to inductively coupled channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Capacity-achieving CPM schemes
IEEE Transactions on Information Theory
IEEE Transactions on Communications
Tighter bounds on the capacity of finite-state channels via Markov set-chains
IEEE Transactions on Information Theory
Asymptotics of entropy rate in special families of hidden Markov chains
IEEE Transactions on Information Theory
IEEE Transactions on Communications
Noisy constrained capacity for BSC channels
IEEE Transactions on Information Theory
IEEE Transactions on Communications
On the capacity of underwater wireless optical channels
Proceedings of the Eighth ACM International Conference on Underwater Networks and Systems
| Hi-index | 755.26 |
The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general channels with memory by means of finite-state approximations. Further upper and lower bounds can be computed by reduced-state methods