The search functionality is under construction.

IEICE TRANSACTIONS on Fundamentals

A Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS

Tomoharu SHIBUYA, Ryo HASEGAWA, Kohichi SAKANIWA

  • Full Text Views

    0

  • Cite this

Summary :

In this paper, we introduce a lower bound for the generalized Hamming weights, which is applicable to arbitrary linear code, in terms of the notion of well-behaving. We also show that any [n,k] linear code C over a finite field F is the t-th rank MDS for t such that g(C)+1 t k where g(C) is easily calculated from the basis of Fn so chosen that whose first n-k elements generate C. Finally, we apply our result to Reed-Solomon, Reed-Muller and algebraic geometry codes on Cab, and determine g(C) for each code.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.6 pp.1090-1101
Publication Date
1999/06/25
Publicized
Online ISSN
DOI
Type of Manuscript
PAPER
Category
Information Theory and Coding Theory

Authors

Keyword