Advanced

Searching for high-rate convolutional codes via binary syndrome trellises

Hug, Florian LU ; Bocharova, Irina LU ; Johannesson, Rolf LU and Kudryashov, Boris LU (2009) IEEE International Symposium on Information Theory (ISIT), 2009 In [Host publication title missing] 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:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
[Host publication title missing]
pages
1358 - 1362
conference name
IEEE International Symposium on Information Theory (ISIT), 2009
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
2009-04-30 11:26:20
date last changed
2016-10-13 04:55:16
@misc{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},
  language     = {eng},
  pages        = {1358--1362},
  series       = {[Host publication title missing]},
  title        = {Searching for high-rate convolutional codes via binary syndrome trellises},
  url          = {http://dx.doi.org/10.1109/ISIT.2009.5205916},
  year         = {2009},
}