@article {24220,
	title = {Spectral efficiency of adaptive coded modulation in urban microcellular networks},
	journal = {IEEE Transactions on Vehicular Technology},
	volume = {50},
	year = {2001},
	pages = {205-222},
	publisher = {IEEE},
	keywords = {Adaptive coding, Convolutional codes, Degradation, Fading, Information rates, Intelligent networks, Interference},
	doi = {10.1109/25.917922},
	author = {Kjell J{\o}rgen {Hole} and Oien, G.E.}
}
@article {24218,
	title = {Adaptive multidimensional coded modulation over flat fading channels},
	journal = { IEEE Journal on Selected Areas in Communications (IEEE JSAC)},
	volume = {18},
	year = {2000},
	pages = {1153-1158},
	publisher = {IEEE},
	keywords = {Adaptive coding, Additive white noise, AWGN channels, Codecs, Convolutional codes, Decoding, Fading, Feedback, Modulation coding, Multidimensional systems},
	doi = {10.1109/49.857915},
	author = {Kjell J{\o}rgen {Hole} and Holm, H. and Oien, G.E.}
}
@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}}
}
@article {24227,
	title = {  Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes},
	journal = {IEEE Transactions on Information Theory },
	volume = {43},
	year = {1997},
	pages = {1301-1305},
	publisher = {IEEE},
	abstract = {Consider a cycle in the state diagram of a convolutional code. The average weight per branch of the cycle is equal to the total Hamming weight of all labels on the branches divided by the number of branches. Let w0\&nbsp;be the minimum average weight per branch over all cycles in the state diagram, except the zero state self-loop of weight zero. Codes with low w0\&nbsp;result in high bit error probabilities when they are used with either Viterbi or sequential decoding. Hemmati and Costello (1980) showed that w0\&nbsp;is upper-bounded by 2ν-2/(3{\textperiodcentered}2ν-2-1) for a class of (2,1) codes where ν denotes the constraint length. In the present correspondence it is shown that the bound is valid for a large class of (n,n-1) codes, n⩾2. Examples of high-rate codes with w0\&nbsp;equal to the upper bound are also given. Hemmati and Costello defined a class of codes to be asymptotically catastrophic if w\&nbsp;0\&nbsp;approaches zero for large ν. The class of (n,n-1) codes constructed by Wyner and Ash (1963) is shown to be asymptotically catastrophic. All codes in the class have minimum possible w0\&nbsp;equal to 1/ν},
	keywords = {Convolutional codes, error statistics, minimisation},
	doi = {10.1109/18.605599},
	author = {Hole, M.F. and Kjell J{\o}rgen {Hole}}
}
@article {24228,
	title = { Cosets of convolutional codes with short maximum zero-run lengths},
	journal = {IEEE Transactions on Information Theory},
	volume = {41},
	year = {1995},
	pages = {1145-1150},
	publisher = {IEEE},
	abstract = {Communication systems and storage systems derive symbol synchronization from the received symbol stream. To facilitate symbol synchronization, the channel sequences must have a short maximum zero-run length. One way to achieve this is to use a coset of an (n, k) convolutional code to generate the channel inputs. For k⩽n-2, it is shown that there exist cosets with short maximum zero-run length for any constraint length. Any coset of an (n, n-1) code with high rate and/or large constraint length is shown to have a large maximum zero-run length. A systematic procedure for obtaining cosets with short maximum zero-run length from (n, k) codes is presented, and new cosets with short maximum zero-run length and large minimum Hamming distance are tabulated},
	keywords = {Convolutional codes, encoding, Error correction, Hamming distance},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24223,
	title = {Improved coding techniques for preceded partial-response channels},
	journal = { IEEE Transactions on Information Theory},
	volume = {40},
	year = {1994},
	pages = {482 - 493},
	publisher = {IEEE},
	abstract = {A coset of a convolutional code may be used to generate a zero-run length limited trellis code for a 1-D partial-response channel. The free squared Euclidean distance, dfree2, at the channel output is lower bounded by the free Hamming distance of the convolutional code. The lower bound suggests the use of a convolutional code with maximal free Hamming distance, dmax(R,N), for given rate R and number of decoder states N. In this paper we present cosets of convolutional codes that generate trellis codes with dfree\&nbsp;2\&gt;dmax(R,N) for rates 1/5⩽R⩽7/9 and (d\&nbsp;free2=dmax(R,N) for R=13/16,29/32,61/64, The tabulated convolutional codes with R⩽7/9 were not optimized for Hamming distance. Instead, a computer search was used to determine cosets of convolutional codes that exploit the memory of the 1-D channel to increase dfree2\&nbsp;at the channel output. The search was limited by only considering cosets with certain structural properties. The R⩾13/16 codes were obtained using a new construction technique for convolutional codes with free Hamming distance 4. Newly developed bounds on the maximum zero-run lengths of cosets were used to ensure a short maximum run length at the 1-D channel output},
	keywords = {Convolutional codes, encoding, telecommunication channels, trellis codes},
	doi = {10.1109/18.312170},
	author = {Kjell J{\o}rgen {Hole} and Ytrehus, O.}
}
@article {24221,
	title = {Punctured convolutional codes for the 1-D partial-response channel},
	journal = {IEEE Transactions on Information Theory },
	volume = {37},
	year = {1991},
	pages = {808-817},
	publisher = {IEEE},
	abstract = {A coded (1-D) system containing a punctured convolutional encoder is analyzed. In general, a punctured encoder with 2v\&nbsp;states results in a decoder trellis with 2v+1\&nbsp;states and a periodically time-varying branch structure. A class C of punctured convolutional encoders for which the decoder trellis has a fixed branch structure with 2v\&nbsp;states is described. An encoder in this class can be combined with a precoder to form a new punctured convolutional encoder that generates the output from the precoder. The author determines the set of good variable-rate trellis codes for selectable rate encoding and Viterbi decoding. A set of variable-rate trellis codes is generated by a variable-rate punctured convolutional encoder in C. The author also determines punctured convolutional encoders in C that generate a single good high-rate trellis code.},
	keywords = {Convolutional codes, Decoding, Euclidean distance, Hamming distance},
	doi = {10.1109/18.79950},
	author = {Kjell J{\o}rgen {Hole}}
}
