Searching for high-rate convolutional codes via binary syndrome trellises
(2009) IEEE International Symposium on Information Theory (ISIT), 2009 p.1358-1362- Abstract
- Rate R=(c-1)/c convolutional codes of constraint length nu can be represented by conventional syndrome trellises with a state complexity of s=nu or by binary syndrome trellises with a state complexity of s=nu or s=nu+1, which corresponds to at most 2^s states at each trellis level. It is shown that if the parity-check polynomials fulfill certain conditions, there exist binary syndrome trellises with optimum state complexity s=nu.
The BEAST is modified to handle parity-check matrices and used to generate code tables for optimum free distance rate R=(c-1)/c, c=3,4,5, convolutional codes for conventional syndrome trellises and binary syndrome trellises with optimum state complexity. These results show that the loss in... (More) - Rate R=(c-1)/c convolutional codes of constraint length nu can be represented by conventional syndrome trellises with a state complexity of s=nu or by binary syndrome trellises with a state complexity of s=nu or s=nu+1, which corresponds to at most 2^s states at each trellis level. It is shown that if the parity-check polynomials fulfill certain conditions, there exist binary syndrome trellises with optimum state complexity s=nu.
The BEAST is modified to handle parity-check matrices and used to generate code tables for optimum free distance rate R=(c-1)/c, c=3,4,5, convolutional codes for conventional syndrome trellises and binary syndrome trellises with optimum state complexity. These results show that the loss in distance properties due to the optimum state complexity restriction for binary trellises is typically negligible. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1369521
- author
- Hug, Florian LU ; Bocharova, Irina LU ; Johannesson, Rolf LU and Kudryashov, Boris LU
- organization
- publishing date
- 2009
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- pages
- 1358 - 1362
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2009
- conference location
- Seoul, Korea, Democratic People's Republic of
- conference dates
- 2009-06-28 - 2009-07-03
- external identifiers
-
- wos:000280141400276
- scopus:70449510554
- DOI
- 10.1109/ISIT.2009.5205916
- language
- English
- LU publication?
- yes
- id
- 601dc7ef-083f-42b6-8fa3-332e14478bfb (old id 1369521)
- date added to LUP
- 2016-04-04 13:28:23
- date last changed
- 2022-02-21 07:08:48
@inproceedings{601dc7ef-083f-42b6-8fa3-332e14478bfb,
abstract = {{Rate R=(c-1)/c convolutional codes of constraint length nu can be represented by conventional syndrome trellises with a state complexity of s=nu or by binary syndrome trellises with a state complexity of s=nu or s=nu+1, which corresponds to at most 2^s states at each trellis level. It is shown that if the parity-check polynomials fulfill certain conditions, there exist binary syndrome trellises with optimum state complexity s=nu.<br/><br>
<br/><br>
The BEAST is modified to handle parity-check matrices and used to generate code tables for optimum free distance rate R=(c-1)/c, c=3,4,5, convolutional codes for conventional syndrome trellises and binary syndrome trellises with optimum state complexity. These results show that the loss in distance properties due to the optimum state complexity restriction for binary trellises is typically negligible.}},
author = {{Hug, Florian and Bocharova, Irina and Johannesson, Rolf and Kudryashov, Boris}},
booktitle = {{[Host publication title missing]}},
language = {{eng}},
pages = {{1358--1362}},
title = {{Searching for high-rate convolutional codes via binary syndrome trellises}},
url = {{https://lup.lub.lu.se/search/files/6128259/1593176.pdf}},
doi = {{10.1109/ISIT.2009.5205916}},
year = {{2009}},
}