Skip to main navigation Skip to search Skip to main content

Bounds on the weight hierarchies of a kind of linear codes satisfying non-chain condition

  • Zihui Liu*
  • , Wende Chen
  • *Corresponding author for this work
  • Peking University
  • CAS - Academy of Mathematics and System Sciences

Research output: Contribution to journalArticlepeer-review

Abstract

The upper bound of weight hierarchies of codes with a divided-chain of arbitrary continuous break points are studied and the codes satisfying the upper-bound are constructed by finite projective geometry, in particular, the geometrical construction is tight for the upper-bound weight hierarchies.

Original languageEnglish
Pages (from-to)220-224
Number of pages5
JournalChinese Journal of Electronics
Volume14
Issue number2
Publication statusPublished - Apr 2005
Externally publishedYes

Keywords

  • Break points
  • Chain condition
  • Difference sequence (DS)
  • Divided-chain condition
  • Generalized hamming weight
  • Length/dimension-profile
  • Upper-Bound construction
  • Weight hierarchies

Fingerprint

Dive into the research topics of 'Bounds on the weight hierarchies of a kind of linear codes satisfying non-chain condition'. Together they form a unique fingerprint.

Cite this