Trellis complexity of short linear codes

Irina Bocharova; Rolf Johannesson; Boris Kudryashov

doi:10.1109/TIT.2006.887522

Trellis complexity of short linear codes

Irina Bocharova, Rolf Johannesson, Boris Kudryashov

Institutionen för elektro- och informationsteknik

Forskningsoutput: Tidskriftsbidrag › Artikel i vetenskaplig tidskrift › Peer review

Sammanfattning

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

Originalspråk	engelska
Sidor (från-till)	361-368
Tidskrift	IEEE Transactions on Information Theory
Volym	53
Nummer	1
DOI	https://doi.org/10.1109/TIT.2006.887522
Status	Published - 2007

Ämnesklassifikation (UKÄ)

Elektroteknik och elektronik

Tillgång till dokument

10.1109/TIT.2006.887522

Citera det här

@article{ed1d198a0394438c8b2fafc160670700,

title = "Trellis complexity of short linear codes",

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",

keywords = "short binary linear codes, double zero-tail termination, linear codes, binary codes, trellis codes, DZT, Shuurman's bound, trellis complexity",

author = "Irina Bocharova and Rolf Johannesson and Boris Kudryashov",

year = "2007",

doi = "10.1109/TIT.2006.887522",

language = "English",

volume = "53",

pages = "361--368",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Trellis complexity of short linear codes

AU - Bocharova, Irina

AU - Johannesson, Rolf

AU - Kudryashov, Boris

PY - 2007

Y1 - 2007

N2 - 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

AB - 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

KW - short binary linear codes

KW - double zero-tail termination

KW - linear codes

KW - binary codes

KW - trellis codes

KW - DZT

KW - Shuurman's bound

KW - trellis complexity

U2 - 10.1109/TIT.2006.887522

DO - 10.1109/TIT.2006.887522

M3 - Article

SN - 0018-9448

VL - 53

SP - 361

EP - 368

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -

Trellis complexity of short linear codes

Sammanfattning

Ämnesklassifikation (UKÄ)

Tillgång till dokument

Fingeravtryck

Citera det här