@article {24208,
	title = {Adaptive coded modulation with receive antenna diversity and imperfect channel knowledge at receiver and transmitter},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {55},
	year = {2006},
	pages = {458 - 465},
	publisher = {IEEE},
	abstract = {Unifying and generalizing the works of Cai and Giannakis and Oien et al., the performance of an adaptive trellis-coded modulation system where receive antenna diversity is implemented by means of maximum ratio combining is analyzed and optimized. As in the work of Cai and Giannakis, the analysis is done in the presence of both estimation and prediction errors. Rayleigh fading on each subchannel is considered, with the estimation and prediction being performed independently on each subchannel. The system optimization process is done in such a way that the throughput is maximized under a bit-error-rate (BER) constraint. The numerical example employs a Jakes-fading spectrum and shows how the power should be distributed between pilot and data symbols and how often pilot symbols should be transmitted for maximum throughput under an instantaneous (with respect to the predicted channel) BER constraint.},
	keywords = {Adaptive systems, Bit error rate, Diversity reception, Estimation error, Modulation coding, Performance Analysis, Rayleigh channels, Receiving antennas, Throughput, Transmitters},
	doi = {10.1109/TVT.2005.863348},
	author = {Duong, D.V. and Oien, G.E. and Kjell J{\o}rgen {Hole}}
}
@article {24225,
	title = {On classes of convolutional codes that are not asymptotically catastrophic},
	journal = { IEEE Transactions on Information Theory },
	volume = {46},
	year = {2000},
	pages = {663-669},
	publisher = {IEEE},
	abstract = {The author denotes by w0\&nbsp;the minimum average weight per edge over all nonzero cycles in the state diagram for a convolutional code, and assumes that a technique is available for generating canonical parity-check matrices for codes with increasing degree m. The obtained class of codes is asymptotically catastrophic if w0\&nbsp;approaches zero for large m. We prove the existence of convolutional code classes that are not asymptotically catastrophic by providing explicit constructions of codes with nonzero w0\&nbsp;for all m},
	keywords = {Bit error rate, Convolutional codes},
	doi = {10.1109/18.825838},
	author = {Kjell J{\o}rgen {Hole}}
}
