article · 2005

Braided convolutional codes

Wei Zhang, Michael Lentmaier, Daniel J. Costello, Kamil Sh. Zigangirov

Cited by 10Abstract and details only

Abstract

We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length.

Cite this paper

APA 7

Zhang, W., Lentmaier, M., Costello, D. J., & Zigangirov, K. S. (2005). Braided convolutional codes. https://doi.org/10.1109/isit.2005.1523404

MLA 9

Zhang, Wei, et al. “Braided convolutional codes.” 2005, pp. 592–96, https://doi.org/10.1109/isit.2005.1523404.

Chicago

Zhang, Wei, Michael Lentmaier, Daniel J. Costello, and Kamil Sh. Zigangirov. 2005. “Braided convolutional codes.” https://doi.org/10.1109/isit.2005.1523404.

Harvard

Zhang, W. et al. (2005) ‘Braided convolutional codes’. Available at: https://doi.org/10.1109/isit.2005.1523404.

BibTeX

@article{zhang2005braided,
  title = {{Braided convolutional codes}},
  author = {Zhang, Wei and Lentmaier, Michael and Costello, Daniel J. and Zigangirov, Kamil Sh.},
  pages = {592--596},
  year = {2005},
  doi = {10.1109/isit.2005.1523404}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.