• DocumentCode
    2024654
  • Title

    Improved Identifying Codes in F2n

  • Author

    Exoo, G. ; Laihonen, T. ; Ranto, S.

  • Author_Institution
    Dept. of Math. & Comput. Sci., Indiana State Univ., Terre Haute, IN
  • fYear
    2007
  • fDate
    24-29 June 2007
  • Firstpage
    1021
  • Lastpage
    1025
  • Abstract
    In binary Hamming spaces, we construct new 1- identifying codes which improve on previously known upper bounds on the cardinalities of 1-identifying codes for many lengths when n ges 10. We also construct tau-identifying codes using the direct sum of tau codes that are 1-identifying.
  • Keywords
    Hamming codes; binary codes; binary Hamming space; binary field; direct sum of tau codes; identifying code; Computer science; Energy conservation; Fault diagnosis; Hamming distance; Hypercubes; Mathematics; Multiprocessing systems; Testing; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. ISIT 2007. IEEE International Symposium on
  • Conference_Location
    Nice
  • Print_ISBN
    978-1-4244-1397-3
  • Type

    conf

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