By Topic

Generalized Hamming weights of nonlinear codes and the relation to the Z4-linear representation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Reuven, I. ; Dept. of Electr. Eng., Tel Aviv Univ., Israel ; Be'ery, Y.

We give a new definition of generalized Hamming weights of nonlinear codes and a new interpretation connected with it. These generalized weights are determined by the entropy/length profile of the code. We show that this definition characterizes the performance of nonlinear codes on the wire-tap channel of type II. The new definition is invariant under translates of the code, it satisfies the property of strict monotonicity and the generalized Singleton bound. We check the relations between the generalized weight hierarchies of Z4-linear codes and their binary image under the Gray map. We also show that the binary image of a Z4-linear code is a symmetric, not necessarily rectangular code. Moreover, if this binary image is a linear code then it admits a twisted squaring construction

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 2 )