Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

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 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
; ; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
IEEE International Symposium on Information Theory, 2002. Proceedings.
pages
1 pages
conference name
IEEE International Symposium on Information Theory (ISIT), 2002
conference location
Lausanne, Switzerland
conference dates
2002-06-30 - 2002-07-05
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
2016-04-04 14:31:42
date last changed
2022-01-30 02:11:46
@inproceedings{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}},
  booktitle    = {{IEEE International Symposium on Information Theory, 2002. Proceedings.}},
  isbn         = {{0-7803-7501-7}},
  language     = {{eng}},
  pages        = {{259--259}},
  title        = {{How to efficiently find the minimum distance of tailbiting codes}},
  url          = {{http://dx.doi.org/10.1109/ISIT.2002.1023531}},
  doi          = {{10.1109/ISIT.2002.1023531}},
  year         = {{2002}},
}