• DocumentCode
    895010
  • Title

    On the second greedy weight for linear codes of dimension at least 4

  • Author

    Chen, Wende ; Klove, T.

  • Author_Institution
    Center of Inf. Security, Acad. of Math. & Syst. Sci., Beijing, China
  • Volume
    50
  • Issue
    2
  • fYear
    2004
  • Firstpage
    354
  • Lastpage
    356
  • Abstract
    The maximum of g2 - d2 for linear [n,k,d;q] codes C is studied. Here d2 is the smallest size of the support of a two-dimensional subcode of C and g2 is the smallest size of the support of a two-dimensional subcode of C which contains a codeword of weight d. For codes of dimension 4 or more, upper and lower bounds on the maximum of g2-d2 are given.
  • Keywords
    cryptography; dual codes; linear codes; linear codes; lower bound; second greedy weight; two-dimensional subcode; upper bound; Control systems; Costs; Councils; Cryptography; Hamming weight; Information security; Laboratories; Linear code; Mathematics; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2003.822601
  • Filename
    1266811
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=895010