Advanced

How to efficiently find the minimum distance of tailbiting codes

Bocharova, Irina LU ; Handlery, Marc; 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.259-259
Abstract
A bidirectional algorithm for computing spectral coefficients of convolutional and tailbiting codes is presented and used to obtain new 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:0036350155
ISBN
0-7803-7501-7
DOI
10.1109/ISIT.2002.1023531
language
English
LU publication?
yes
id
a7aac183-1bc2-4d51-8738-eae3f7779db7 (old id 629027)
date added to LUP
2007-12-05 09:48:46
date last changed
2016-10-13 05:02:40
@misc{a7aac183-1bc2-4d51-8738-eae3f7779db7,
  abstract     = {A bidirectional algorithm for computing spectral coefficients of convolutional and tailbiting codes is presented and used to obtain new codes.},
  author       = {Bocharova, Irina and Handlery, Marc and Johannesson, Rolf and Kudryashov, Boris},
  isbn         = {0-7803-7501-7},
  language     = {eng},
  pages        = {259--259},
  series       = {IEEE International Symposium on Information Theory, 2002. Proceedings.},
  title        = {How to efficiently find the minimum distance of tailbiting codes},
  url          = {http://dx.doi.org/10.1109/ISIT.2002.1023531},
  year         = {2002},
}