On the existence of generalized rank weights
Date of Issue2012
International Symposium on Information Theory and its Applications (2012 : Honolulu, US)
School of Physical and Mathematical Sciences
We consider rank metric codes. We introduce a definition of generalized rank weights, that represents a counterpart of generalized “Hamming weights” with respect to the rank metric. We motivate our definition by the security drop behavior of rank metric wiretap network codes, by analogy to the way generalized Hamming weights characterize linear wiretap codes. We give some examples and properties to support our definition.
© 2012 IEICE. This paper was published in 2012 International Symposium on Information Theory and its Applications (ISITA2012) and is made available as an electronic reprint (preprint) with permission of IEICE. The paper can be found at the following official URL: [http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6400964&contentType=Conference+Publications&searchField%3DSearch_All%26queryText%3DOn+the+existence+of+generalized+rank+weights]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.