@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}}
}
