Sciweavers

12 search results - page 1 / 3
» On the Relative Generalized Hamming Weights of Linear Codes ...
Sort
View
SIAMDM
2010
105views more  SIAMDM 2010»
13 years 5 months ago
On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
We first present an equivalent definition of relative generalized Hamming weights of a linear code and its subcodes, and we develop a method using finite projective geometry. Makin...
Zihui Liu, Jie Wang, Xin-Wen Wu
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
14 years 3 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
TIT
2011
144views more  TIT 2011»
13 years 5 months ago
Network Generalized Hamming Weight
— 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 ...
Chi Kin Ngai, Raymond W. Yeung, Zhen Zhang
IACR
2011
91views more  IACR 2011»
12 years 10 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner
DCC
2001
IEEE
14 years 10 months ago
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
Houshou Chen, John T. Coffey