• DocumentCode
    2618621
  • Title

    On noncatastrophic binary (d, k) trellis codes with large free distances

  • Author

    Lyu, Ling-Tyan ; Lin, Mao-Chao

  • Author_Institution
    Telecommun. Lab., Minist. of Transp. & Commun., Taiwan, China
  • fYear
    1994
  • fDate
    27 Jun-1 Jul 1994
  • Firstpage
    345
  • Abstract
    We construct a class of noncatastrophic binary (d, k) trellis codes with large free distances1, using the structure of a class of (d, k) trellis codes proposed by Lee and Wolf in 1989. However in our design, two disjoint Steiner triple systems are used as frames to select two disjoint subsets from a maximal concatenatable (d, k) block code
  • Keywords
    block codes; concatenated codes; set theory; trellis codes; disjoint Steiner triple systems; disjoint subsets; large free distances; maximal concatenatable block code; noncatastrophic binary trellis codes; Combinatorial mathematics; Convolutional codes; Error correction codes; Notice of Violation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
  • Conference_Location
    Trondheim
  • Print_ISBN
    0-7803-2015-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1994.394673
  • Filename
    394673
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2618621