• DocumentCode
    2386410
  • Title

    Error-correcting codes over an alphabet of four elements

  • Author

    Bogdanova, Galina T. ; Brouwer, Andries E. ; Kapralov, Stoian N. ; Östergard, Patric R J

  • Author_Institution
    Inst. of Math. & Inf., Bulgarian Acad. of Sci., Tarnovo, Bulgaria
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    142
  • Abstract
    The problem of finding the values of Aq(n,d)-the maximum size of a code of length n and minimum distance d over an alphabet of q elements-is considered. When q⩽M<2q, all parameters for which Aq(n,d)=M are determined. Methods for obtaining upper and lower bounds on A4(n,d) are discussed
  • Keywords
    combinatorial mathematics; error correction codes; alphabet of four elements; combinatorial coding theory; error-correcting codes; lower bounds; maximum code size; minimum distance; optimal codes; upper bounds; Conferences; Error correction codes; Linear code; Mathematics; Orbits; Stochastic processes; Upper bound; Vectors;
  • 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.866434
  • Filename
    866434
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2386410