• DocumentCode
    2054650
  • Title

    Good ternary 2-traceability codes exist

  • Author

    Kabatiansky, Grigory

  • Author_Institution
    Dobrushin Math Lab, IPPI RAN, Moscow, Russia
  • fYear
    2004
  • fDate
    27 June-2 July 2004
  • Firstpage
    204
  • Abstract
    This paper proves that random ternary codes are 2-traceability codes for code rate R≥c>0. This gives an affirmative answer to a particular case of the open problem of the minimum size qt of the alphabet over which there exist t-traceability codes with nonvanishing code rate.
  • Keywords
    combinatorial mathematics; random codes; ternary codes; alphabet size; nonvanishing code rate; random ternary 2-traceability code; Code standards; Cryptography; Hamming distance; Laboratories; Radio access networks; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
  • Print_ISBN
    0-7803-8280-3
  • Type

    conf

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