12 search results - page 2 / 3 » Generalized Hamming Weights of q-ary Reed-Muller Codes |
SIAMDM
2010
13 years 1 days ago
2010
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...
TIT
2011
13 years 7 days ago
2011
— 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 ...
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
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...
IACR
2011
12 years 5 months ago
2011
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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...