Advanced

Further results on binary convolutional codes with an optimum distance profile

Johannesson, Rolf LU and Paaske, Erik (1978) In IEEE Transactions on Information Theory 24(2). p.264-268
Abstract
Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit the search for codes with a large value ofd_{infty}. We present extensive lists of such robustly optimal codes containing rateR = l/2nonsystematic codes, several withd_{infty}superior to that of any previously known code of the same rate and memory; rateR = 2/3systematic codes; and rateR = 2/3nonsystematic codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes... (More)
Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit the search for codes with a large value ofd_{infty}. We present extensive lists of such robustly optimal codes containing rateR = l/2nonsystematic codes, several withd_{infty}superior to that of any previously known code of the same rate and memory; rateR = 2/3systematic codes; and rateR = 2/3nonsystematic codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
IEEE Transactions on Information Theory
volume
24
issue
2
pages
264 - 268
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • Scopus:0017948629
ISSN
0018-9448
language
English
LU publication?
yes
id
c3cc6b1a-9841-41ea-91a4-5dccbbee847b (old id 1056922)
alternative location
http://ieeexplore.ieee.org/iel5/18/22701/01055850.pdf
date added to LUP
2008-04-17 12:57:29
date last changed
2016-10-13 04:32:52
@misc{c3cc6b1a-9841-41ea-91a4-5dccbbee847b,
  abstract     = {Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit the search for codes with a large value ofd_{infty}. We present extensive lists of such robustly optimal codes containing rateR = l/2nonsystematic codes, several withd_{infty}superior to that of any previously known code of the same rate and memory; rateR = 2/3systematic codes; and rateR = 2/3nonsystematic codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes.},
  author       = {Johannesson, Rolf and Paaske, Erik},
  issn         = {0018-9448},
  language     = {eng},
  number       = {2},
  pages        = {264--268},
  publisher    = {ARRAY(0xb779ef0)},
  series       = {IEEE Transactions on Information Theory},
  title        = {Further results on binary convolutional codes with an optimum distance profile},
  volume       = {24},
  year         = {1978},
}