Advanced

Searching for tailbiting codes with large minimum distances

Bocharova, Irina LU ; Kudryashov, Boris LU ; Johannesson, Rolf LU and Ståhl, Per LU (2000) 2000 International Symposium on Information Theory In [Host publication title missing] p.341-341
Abstract
Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. A new lower bound on the maximal state complexity of an arbitrary tailbiting code is derived. The asymptotic behavior of the derived bound is investigated. Some new tailbiting representations for linear block codes of rates R=1/c, c=2,3,4 are presented
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
[Host publication title missing]
pages
341 - 341
conference name
2000 International Symposium on Information Theory
external identifiers
  • Scopus:0034449484
ISBN
0-7803-5857-0
DOI
10.1109/ISIT.2000.866639
language
English
LU publication?
yes
id
858da2a8-c90e-499b-aa8c-309f0e9c5d21 (old id 1057083)
date added to LUP
2008-04-17 15:02:02
date last changed
2016-10-13 04:54:29
@misc{858da2a8-c90e-499b-aa8c-309f0e9c5d21,
  abstract     = {Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. A new lower bound on the maximal state complexity of an arbitrary tailbiting code is derived. The asymptotic behavior of the derived bound is investigated. Some new tailbiting representations for linear block codes of rates R=1/c, c=2,3,4 are presented},
  author       = {Bocharova, Irina and Kudryashov, Boris and Johannesson, Rolf and Ståhl, Per},
  isbn         = {0-7803-5857-0},
  language     = {eng},
  pages        = {341--341},
  series       = {[Host publication title missing]},
  title        = {Searching for tailbiting codes with large minimum distances},
  url          = {http://dx.doi.org/10.1109/ISIT.2000.866639},
  year         = {2000},
}