• DocumentCode
    895129
  • Title

    Hamming distance preserving mappings and trellis codes with constrained binary symbols

  • Author

    Ferreira, H.C. ; Wright, D.A. ; Nel, A.L.

  • Author_Institution
    Lab. for Cybern., Rand Afrikaans Univ., Johannesburg, South Africa
  • Volume
    35
  • Issue
    5
  • fYear
    1989
  • fDate
    9/1/1989 12:00:00 AM
  • Firstpage
    1098
  • Lastpage
    1103
  • Abstract
    The transformation of a linear convolutional code into a run-length-constrained or balanced trellis code with the same or larger free distance is investigated. The transformation involves a Hamming-distance-preserving mapping of the set of unconstrained binary symbols of the convolutional code onto a set of suitably constrained symbols. Simple tests to determine if these mappings can exist and a tree search algorithm for finding such mappings are presented
  • Keywords
    error correction codes; Hamming-distance-preserving mapping; balanced trellis code; constrained binary symbols; free distance; linear convolutional code; run length constrained code; tree search algorithm; Block codes; Communication channels; Convolutional codes; Electrons; Error correction codes; Hamming distance; Modulation coding; Optical receivers; Repeaters; Testing;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.42229
  • Filename
    42229
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=895129