Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Trellis complexity of short linear codes

Bocharova, Irina LU ; Johannesson, Rolf LU and Kudryashov, Boris LU (2007) In IEEE Transactions on Information Theory 53(1). p.361-368
Abstract
An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lower and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) construction
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
short binary linear codes, double zero-tail termination, linear codes, binary codes, trellis codes, DZT, Shuurman's bound, trellis complexity
in
IEEE Transactions on Information Theory
volume
53
issue
1
pages
361 - 368
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000243317600025
  • scopus:33846096689
ISSN
0018-9448
DOI
10.1109/TIT.2006.887522
language
English
LU publication?
yes
id
ed1d198a-0394-438c-8b2f-afc160670700 (old id 628455)
date added to LUP
2016-04-01 16:12:28
date last changed
2022-01-28 18:06:43
@article{ed1d198a-0394-438c-8b2f-afc160670700,
  abstract     = {{An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lower and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) construction}},
  author       = {{Bocharova, Irina and Johannesson, Rolf and Kudryashov, Boris}},
  issn         = {{0018-9448}},
  keywords     = {{short binary linear codes; double zero-tail termination; linear codes; binary codes; trellis codes; DZT; Shuurman's bound; trellis complexity}},
  language     = {{eng}},
  number       = {{1}},
  pages        = {{361--368}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  series       = {{IEEE Transactions on Information Theory}},
  title        = {{Trellis complexity of short linear codes}},
  url          = {{http://dx.doi.org/10.1109/TIT.2006.887522}},
  doi          = {{10.1109/TIT.2006.887522}},
  volume       = {{53}},
  year         = {{2007}},
}