References

• 1. 1)
     • 15. Bahl, L., Cocke, J., Jelinek, F., Raviv, J.: ‘Optimal decoding of linear codes for minimizing symbol error rate’, IEEE Trans. Inf. Theory, 1974, 20, (2), pp. 284–287 (doi: 10.1109/TIT.1974.1055186).
  2. 2)
     • 7. Lang, A., Lankl, B.: ‘Very short channel codes for burst-type transmissions’. 2018 IEEE Military Communications Conf. (MILCOM 2018), Los Angeles, CA, USA, October 2018, pp. 1–9.
  3. 3)
     • 6. Wang, Y.-P., Ramesh, R., Hassan, A., et al: ‘On MAP decoding for tail-biting convolutional codes’. Proc. of 1997 IEEE Int. Symp. on Information Theory, Ulm, Germany, 29 June–4 July 1997, p. 225.
  4. 4)
     • 1. Moqvist, P., Aulin, T.: ‘Trellis termination in CPM’, Electron. Lett., 2000, 36, (23), pp. 1940–1941 (doi: 10.1049/el:20001367).
  5. 5)
     • 2. Huber, J.: ‘Trelliscodierung’ (Springer, Berlin & Heidelberg, 1992), pp. 65–98.
  6. 6)
     • 4. Dantona, V., Hofmann, C., Lattrell, S., et al: ‘Spectrally efficient multilevel CPM waveforms for VHF narrowband communications’. Proc. of 10th Int. ITG Conf. on Systems, Communications and Coding (SCC 2015), Hamburg, Germany, February 2015, pp. 1–6.
  7. 7)
     • 9. Fayyaz, U.U., Barry, J.R.: ‘Low-complexity soft-output decoding of polar codes’, J. Sel. Areas Commun., 2014, 32, (6), pp. 958–966 (doi: 10.1109/JSAC.2014.140515).
  8. 8)
     • 5. Ma, H., Wolf, J.: ‘On tail biting convolutional codes’, IEEE Trans. Commun., 1986, 34, (2), pp. 104–111 (doi: 10.1109/TCOM.1986.1096498).
  9. 9)
     • 8. Vangala, H., Viterbo, E., Hong, Y.: ‘A Comparative Study of Polar Code Constructions for the AWGN Channel’. 2015, arXiv preprint arXiv:1501.02473, pp. 1–9.