• DocumentCode
    2519539
  • Title

    About convexity of one function from coding theory

  • Author

    Blinovsky, Vladimir

  • Author_Institution
    Inst. of Inf. Transm. Problems, Moscow
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    1973
  • Lastpage
    1976
  • Abstract
    We complete the proof of upper bound for the multiple packing of q-ary Hamming space.
  • Keywords
    Hamming codes; encoding; coding theory; q-ary Hamming space multiple packing; Codes; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2008. ISIT 2008. IEEE International Symposium on
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-2256-2
  • Electronic_ISBN
    978-1-4244-2257-9
  • Type

    conf

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