Tailbiting codes obtained via convolutional codes with large active distance-slopes
(2002) In IEEE Transactions on Information Theory 48(9). p.2577-2587- Abstract
- The slope of the active distances is an important parameter when investigating the error-correcting capability of convolutional codes and the distance behavior of concatenated convolutional codes. The slope of the active distances is equal to the minimum average weight cycle in the state-transition diagram of the encoder. A general upper bound on the slope depending on the free distance of the convolutional code and new upper bounds on the slope of special classes of binary convolutional codes are derived. Moreover, a search technique, resulting in new tables of rate R = 1/2 and rate R = 1/3 convolutional encoders with high memories and large active distance-slopes is presented. Furthermore, we show that convolutional codes with large... (More)
- The slope of the active distances is an important parameter when investigating the error-correcting capability of convolutional codes and the distance behavior of concatenated convolutional codes. The slope of the active distances is equal to the minimum average weight cycle in the state-transition diagram of the encoder. A general upper bound on the slope depending on the free distance of the convolutional code and new upper bounds on the slope of special classes of binary convolutional codes are derived. Moreover, a search technique, resulting in new tables of rate R = 1/2 and rate R = 1/3 convolutional encoders with high memories and large active distance-slopes is presented. Furthermore, we show that convolutional codes with large slopes can be used to obtain new tailbiting block codes with large minimum distances. Tables of rate R = 1/2 and rate R = 1/3 tailbiting codes with larger minimum distances than the best previously known quasi-cyclic codes are given. Two new tailbiting codes also have larger minimum distances than the best previously known binary linear block codes with same size and length. One of them is also superior in terms of minimum distance to any previously known binary nonlinear block code with the same set of parameters. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/330081
- author
- Bocharova, Irina LU ; Handlery, Marc LU ; Johannesson, Rolf LU and Kudryashov, Boris LU
- organization
- publishing date
- 2002
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- convolutional codes, active distances, quasi-cyclic, minimum distance, tailbiting codes, codes
- in
- IEEE Transactions on Information Theory
- volume
- 48
- issue
- 9
- pages
- 2577 - 2587
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- wos:000177580700013
- scopus:0036714382
- ISSN
- 0018-9448
- DOI
- 10.1109/TIT.2002.801475
- language
- English
- LU publication?
- yes
- id
- 14b34d6c-56e4-4bad-b9a8-5187fd2adfe4 (old id 330081)
- date added to LUP
- 2016-04-01 16:03:55
- date last changed
- 2022-01-28 17:00:53
@article{14b34d6c-56e4-4bad-b9a8-5187fd2adfe4,
abstract = {{The slope of the active distances is an important parameter when investigating the error-correcting capability of convolutional codes and the distance behavior of concatenated convolutional codes. The slope of the active distances is equal to the minimum average weight cycle in the state-transition diagram of the encoder. A general upper bound on the slope depending on the free distance of the convolutional code and new upper bounds on the slope of special classes of binary convolutional codes are derived. Moreover, a search technique, resulting in new tables of rate R = 1/2 and rate R = 1/3 convolutional encoders with high memories and large active distance-slopes is presented. Furthermore, we show that convolutional codes with large slopes can be used to obtain new tailbiting block codes with large minimum distances. Tables of rate R = 1/2 and rate R = 1/3 tailbiting codes with larger minimum distances than the best previously known quasi-cyclic codes are given. Two new tailbiting codes also have larger minimum distances than the best previously known binary linear block codes with same size and length. One of them is also superior in terms of minimum distance to any previously known binary nonlinear block code with the same set of parameters.}},
author = {{Bocharova, Irina and Handlery, Marc and Johannesson, Rolf and Kudryashov, Boris}},
issn = {{0018-9448}},
keywords = {{convolutional codes; active distances; quasi-cyclic; minimum distance; tailbiting codes; codes}},
language = {{eng}},
number = {{9}},
pages = {{2577--2587}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
series = {{IEEE Transactions on Information Theory}},
title = {{Tailbiting codes obtained via convolutional codes with large active distance-slopes}},
url = {{http://dx.doi.org/10.1109/TIT.2002.801475}},
doi = {{10.1109/TIT.2002.801475}},
volume = {{48}},
year = {{2002}},
}