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 language | English |
|---|---|
| Pages (from-to) | 220-224 |
| Number of pages | 5 |
| Journal | Chinese Journal of Electronics |
| Volume | 14 |
| Issue number | 2 |
| Publication status | Published - Apr 2005 |
| Externally published | Yes |
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver