Kjell Jørgen Hole On classes of convolutional codes that are not asymptotically catastrophic. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:663-669 [Journal]
Kjell Jørgen Hole New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1079-0 [Journal]
Kjell Jørgen Hole Punctured convolutional codes for the 1-D partial-response channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:808-817 [Journal]
Kjell Jørgen Hole Cosets of convolutional codes with short maximum zero-run lengths. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:4, pp:1145-1150 [Journal]
M. F. Hole, Kjell Jørgen Hole Low-complexity decoding of partial unit memory codes on precoded partial-response channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:3, pp:1052-1058 [Journal]
M. F. Hole, Kjell Jørgen Hole Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1301-1305 [Journal]
Kjell Jørgen Hole, Øyvind Ytrehus Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:423-431 [Journal]