Advanced

Convolutional codes with large slopes yield better tailbiting codes

Bocharova, Irina LU ; Handlery, Marc LU ; Johannesson, Rolf LU and Kudryashov, Boris LU (2002) IEEE International Symposium on Information Theory (ISIT), 2002 In IEEE International Symposium on Information Theory, 2002. Proceedings. p.258-258
Abstract
Upper bounds on the slope of the active distances for convolutional codes are given. Convolutional codes with large slopes are used to obtain tables of new tailbiting block codes.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
IEEE International Symposium on Information Theory, 2002. Proceedings.
pages
1 pages
conference name
IEEE International Symposium on Information Theory (ISIT), 2002
external identifiers
  • Scopus:0036352167
ISBN
0-7803-7501-7
DOI
10.1109/ISIT.2002.1023530
language
English
LU publication?
yes
id
0b80f203-59f7-4ec7-9b0d-5121a8e0508b (old id 629030)
date added to LUP
2007-12-05 09:52:08
date last changed
2016-10-13 04:56:29
@misc{0b80f203-59f7-4ec7-9b0d-5121a8e0508b,
  abstract     = {Upper bounds on the slope of the active distances for convolutional codes are given. Convolutional codes with large slopes are used to obtain tables of new tailbiting block codes.},
  author       = {Bocharova, Irina and Handlery, Marc and Johannesson, Rolf and Kudryashov, Boris},
  isbn         = {0-7803-7501-7},
  language     = {eng},
  pages        = {258--258},
  series       = {IEEE International Symposium on Information Theory, 2002. Proceedings.},
  title        = {Convolutional codes with large slopes yield better tailbiting codes},
  url          = {http://dx.doi.org/10.1109/ISIT.2002.1023530},
  year         = {2002},
}