On Good Convolutional Codes with Optimal Free Distance for Rates 1/2, 1/3 and 1/4

Search this Article

Author(s)

    • SONE Naoto
    • the Information Processing Center, Naruto University of Education
    • MOHRI Masami
    • the Department of Information Science and Intelligent Systems, Faculty of Engineering, The University of Tokushima
    • MORII Masakatu
    • the Department of Information Science and Intelligent Systems, Faculty of Engineering, The University of Tokushima

Abstract

New good convolutional codes with optimal free distance are tabulated for the unmber of memories M <__- 22 and rate R=1/2, which were selected based on the criterion of minimizing the decoding error rate and bit error rate. Fuithermore, for R=1/3, 1/4 and M <__- 13, we give the new good codes and make clear the existance of the codes with minimum free distance which achieve to Heller's upper bound for M <__- 16.

Journal

  • IEICE Trans. Commun.

    IEICE Trans. Commun. 84(1), 116-119, 2001-01-01

    The Institute of Electronics, Information and Communication Engineers

References:  8

Cited by:  5

Codes

  • NII Article ID (NAID)
    110003218863
  • NII NACSIS-CAT ID (NCID)
    AA10826261
  • Text Lang
    ENG
  • Article Type
    Journal Article
  • ISSN
    09168516
  • Data Source
    CJP  CJPref  NII-ELS 
Page Top