Convolutional codes with large slopes yield better tailbiting codes

Irina Bocharova; Marc Handlery; Rolf Johannesson; Boris Kudryashov

doi:10.1109/ISIT.2002.1023530

Convolutional codes with large slopes yield better tailbiting codes

Irina Bocharova, Marc Handlery, Rolf Johannesson, Boris Kudryashov

Department of Electrical and Information Technology

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

Abstract

Upper bounds on the slope of the active distances for convolutional codes are given. Convolutional codes with large slopes are used to obtain tables of new tailbiting block codes.

Original language	English
Title of host publication	IEEE International Symposium on Information Theory, 2002. Proceedings.
Pages	258
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.2002.1023530
Publication status	Published - 2002
Event	IEEE International Symposium on Information Theory (ISIT), 2002 - Lausanne, Switzerland Duration: 2002 Jun 30 → 2002 Jul 5

Conference

Conference	IEEE International Symposium on Information Theory (ISIT), 2002
Country/Territory	Switzerland
City	Lausanne
Period	2002/06/30 → 2002/07/05

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Access to Document

10.1109/ISIT.2002.1023530

Cite this

@inproceedings{0b80f20359f74ec79b0d5121a8e0508b,

title = "Convolutional codes with large slopes yield better tailbiting codes",

abstract = "Upper bounds on the slope of the active distances for convolutional codes are given. Convolutional codes with large slopes are used to obtain tables of new tailbiting block codes.",

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

year = "2002",

doi = "10.1109/ISIT.2002.1023530",

language = "English",

isbn = "0-7803-7501-7",

pages = "258",

booktitle = "IEEE International Symposium on Information Theory, 2002. Proceedings.",

note = "IEEE International Symposium on Information Theory (ISIT), 2002 ; Conference date: 30-06-2002 Through 05-07-2002",

}

TY - GEN

T1 - Convolutional codes with large slopes yield better tailbiting codes

AU - Bocharova, Irina

AU - Handlery, Marc

AU - Johannesson, Rolf

AU - Kudryashov, Boris

PY - 2002

Y1 - 2002

N2 - Upper bounds on the slope of the active distances for convolutional codes are given. Convolutional codes with large slopes are used to obtain tables of new tailbiting block codes.

AB - Upper bounds on the slope of the active distances for convolutional codes are given. Convolutional codes with large slopes are used to obtain tables of new tailbiting block codes.

U2 - 10.1109/ISIT.2002.1023530

DO - 10.1109/ISIT.2002.1023530

M3 - Paper in conference proceeding

SN - 0-7803-7501-7

SP - 258

BT - IEEE International Symposium on Information Theory, 2002. Proceedings.

T2 - IEEE International Symposium on Information Theory (ISIT), 2002

Y2 - 30 June 2002 through 5 July 2002

ER -

Convolutional codes with large slopes yield better tailbiting codes

Abstract

Conference

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this