View in EDS

Weight Functions and Generalized Hamming Weights of Linear Codes.

Saved in:
Bibliographic Details
Title: Weight Functions and Generalized Hamming Weights of Linear Codes.
Authors: D. Yu. Nogin
Source: Problems of Information Transmission; Apr2005, Vol. 41 Issue 2, p91-104, 14p
Abstract: Abstract We prove that the weight function wt: $$\mathbb{F}_q^k \to \mathbb{Z}$$ on a set of messages uniquely determines a linear code of dimension k up to equivalence. We propose a natural way to extend the rth generalized Hamming weight, that is, a function on r-subspaces of a code C, to a function on $$\mathbb{F}_q^{\left( {_r^k } \right)} \cong \Lambda ^r C$$ . Using this, we show that, for each linear code C and any integer r ≰ k = dim C, a linear code exists whose weight distribution corresponds to a part of the generalized weight spectrum of C, from the rth weights to the kth. In particular, the minimum distance of this code is proportional to the rth generalized weight of C. [ABSTRACT FROM AUTHOR]
Copyright of Problems of Information Transmission is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Be the first to leave a comment!
You must be logged in first