Title of article
Projective codes which satisfy the chain condition Original Research Article
Author/Authors
S. Encheva، نويسنده , , G.D. Cohen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
5
From page
109
To page
113
Abstract
Binary linear codes with length at most one above the Griesmer bound were proven to satisfy the chain condition by Helleseth et al. [1]. Binary linear projective codes with length two above the Griesmer bound which satisfy the chain condition are found. Necessary conditions for binary linear codes for which the two-way chain condition holds are derived.
Keywords
Linear codes , Chain condition , Two-way chain condition
Journal title
Applied Mathematics Letters
Serial Year
2000
Journal title
Applied Mathematics Letters
Record number
897067
Link To Document