• DocumentCode
    2385908
  • Title

    A new family of optimal codes correcting term rank errors

  • Author

    Lund, David ; Gabidulin, Ernst M. ; Honary, Bahram

  • Author_Institution
    Dept. of Commun. Syst., Lancaster Univ., UK
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    115
  • Abstract
    We consider messages represented as matrices. The term rank norm of a matrix is defined as minimal number of lines (rows and columns) which cover all the non zero entries of a matrix. We propose a family of codes correcting term rank errors. These codes are optimal since they reach the Singleton-type bound
  • Keywords
    binary codes; decoding; error correction codes; matrix algebra; Singleton-type bound; matrices; optimal codes; term rank errors correction; Communication systems; Decoding; Digital communication; Electronic mail; Error correction codes; Frequency division multiaccess; Lattices; OFDM; Physics; Telecommunications;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2000. Proceedings. IEEE International Symposium on
  • Conference_Location
    Sorrento
  • Print_ISBN
    0-7803-5857-0
  • Type

    conf

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