@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 {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\ states results in a decoder trellis with 2v+1\ 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\ 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}
}