Searching for tailbiting codes with large minimum distances

Irina Bocharova; Boris Kudryashov; Rolf Johannesson; Per Ståhl

doi:10.1109/ISIT.2000.866639

Searching for tailbiting codes with large minimum distances

Irina Bocharova, Boris Kudryashov, Rolf Johannesson, Per Ståhl

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

139 Downloads (Pure)

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

Original language	English
Title of host publication	[Host publication title missing]
Pages	341
DOIs	https://doi.org/10.1109/ISIT.2000.866639
Publication status	Published - 2000
Event	2000 International Symposium on Information Theory - Sorrento, Italy Duration: 2000 Jun 21 → 2000 Jun 25

Conference

Conference	2000 International Symposium on Information Theory
Country/Territory	Italy
City	Sorrento
Period	2000/06/21 → 2000/06/25

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Access to Document

10.1109/ISIT.2000.866639

searching6966

Cite this

@inproceedings{858da2a8c90e499baa8c309f0e9c5d21,

title = "Searching for tailbiting codes with large minimum distances",

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 = "Irina Bocharova and Boris Kudryashov and Rolf Johannesson and Per St{\aa}hl",

year = "2000",

doi = "10.1109/ISIT.2000.866639",

language = "English",

isbn = "0-7803-5857-0",

pages = "341",

booktitle = "[Host publication title missing]",

note = "2000 International Symposium on Information Theory ; Conference date: 21-06-2000 Through 25-06-2000",

}

TY - GEN

T1 - Searching for tailbiting codes with large minimum distances

AU - Bocharova, Irina

AU - Kudryashov, Boris

AU - Johannesson, Rolf

AU - Ståhl, Per

PY - 2000

Y1 - 2000

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

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

U2 - 10.1109/ISIT.2000.866639

DO - 10.1109/ISIT.2000.866639

M3 - Paper in conference proceeding

SN - 0-7803-5857-0

SP - 341

BT - [Host publication title missing]

T2 - 2000 International Symposium on Information Theory

Y2 - 21 June 2000 through 25 June 2000

ER -

Searching for tailbiting codes with large minimum distances

Abstract

Conference

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this