By Topic

Network generalized hamming weight

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

3 Author(s)
Chi-Kin Ngai ; Chinese Univ. of Hong Kong, Hong Kong, China ; Yeung, R.W. ; Zhixue Zhang

In this paper, we extend the notion of generalized Hamming weight for classical linear block code to linear network codes by introducing the network generalized Hamming weight (NGHW) of a linear block code with respect to a given linear network code. The basic properties of NGHW are studied. We further show that NGHW can be used as a tool to characterize the security performance of a linear network code on a wiretap network. We also introduce the idea of network maximum distance separation code (NMDS code) by extending the notion of maximum distance separation code in classical algebraic coding theory. We prove that NMDS codes play an important role in minimizing the information that an eavesdropper can obtain from the network.

Published in:

Network Coding, Theory, and Applications, 2009. NetCod '09. Workshop on

Date of Conference:

15-16 June 2009