Folded Tree Maximum-Likelihood Decoder for Kronecker Product-Based Codes

Kahraman S., Viterbo E., Celebi M. E.

51st IEEE Annual Allerton Conference on Communication, Control, and Computing, Illinois, United States Of America, 2 - 04 October 2013, pp.629-636 identifier

  • Publication Type: Conference Paper / Full Text
  • City: Illinois
  • Country: United States Of America
  • Page Numbers: pp.629-636
  • Istanbul Technical University Affiliated: Yes


In this paper, we propose efficient maximum-likelihood (ML) decoding for binary Kronecker product-based (KPB) codes. This class of codes, have a matrix defined by the n-fold iterated Kronecker product G(n) = F-circle times n of a binary upper-triangular kernel matrix F, where some columns are suppressed given a specific puncturing pattern. Polar and Reed-Muller codes are well known examples of such KPB codes.