Code constructions and existence bounds for relative generalized Hamming weight

@article{Zhuang2013CodeCA,
  title={Code constructions and existence bounds for relative generalized Hamming weight},
  author={Zhuojun Zhuang and Yuan Luo and Bin Dai},
  journal={Designs, Codes and Cryptography},
  year={2013},
  volume={69},
  pages={275-297}
}
The relative generalized Hamming weight (RGHW) of a linear code C and a subcode C1 is an extension of generalized Hamming weight. The concept was firstly used to protect messages from an adversary in the wiretap channel of type II with illegitimate parties. It was also applied to the wiretap network II for secrecy control of network coding and to trellis-based decoding algorithms for complexity estimation. For RGHW, bounds and code constructions are two related issues. Upper bounds on RGHW show… 
Bounds on relative generalised Hamming weight
TLDR
The authors present a new proof of the Griesmer bound on RGHW by residue code and introduce the new concept of relative chain condition, which provides a new perspective on researches including evaluating trellis complexity and determining the weight hierarchy of code pairs etc.
On Asymptotic Analysis of Relative Generalized Hamming Weight
TLDR
This work improves the previous work by introducing two new asymptotic metrics, respectively, for the cases that r is fixed and r is proportionally increasing with n, which are useful for investigating the optimal performance of RGHW when code length is sufficiently large.
Optimal Code Pairs Satisfying Relative Chain Condition
TLDR
A new proof of the Griesmer bound on RGHW by the idea of residue code is presented and the concept of relative chain condition is introduced and it is shown that code pairs meeting the Singleton, weak Plotkin and GriesMER bounds satisfy this condition.
Relative generalized Hamming weights of cyclic codes
Secure error-correcting network codes with side information leakage
TLDR
This work investigates how to secure k source symbols transmission in a multicast network against an adversary that can obtain k 1 source symbols as side information, eavesdrop μ channels and contaminate d channels.
On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
TLDR
Both weights and generalized weights are related to show that the results and proofs in both cases are usually essentially the same, and see the significance of these similarities in network coding.
New asymptotic metrics for relative generalized Hamming weight
  • R. Matsumoto
  • Computer Science, Mathematics
    2014 IEEE International Symposium on Information Theory
  • 2014
TLDR
The true value of the asymptotic metric for RGHW previously proposed by Zhuang et al. in 2013 is determined and new asymPTotic metrics useful for investigating the optimal performance of linear ramp secret sharing scheme constructed from a pair of linear codes are proposed.
Relative generalized Hamming weights of one-point algebraic geometric codes
TLDR
This paper elaborates on the implication of the relative generalized Hamming weights of the involved codes and devise a method to estimate their value for general one-point algebraic geometric codes.
Some bounds for the relative generalized Hamming weights of some evaluation codes
TLDR
Some bounds are found for the relative generalized Hamming weights of the codes parameterized by the edges of any connected bipartite graph with bipartition (V1, V2) and where |V1 | = n1, |V2| = n2.
On the similarities between rank and Hamming weights and their applications to network coding
TLDR
The aim of this paper is to further relate both distances and show that the results and proofs for both of them are actually essentially the same.
...
...

References

SHOWING 1-10 OF 29 REFERENCES
Some new bounds on relative generalized Hamming weight
TLDR
This paper introduces three new bounds, the generalized Plotkin and Griesmer bounds as well as the relative constant-weight (RCW) bound, and discusses the relations among the new bounds and the Singleton bound.
Generalized Hamming Weights for Linear Codes
TLDR
This work studies d3(C) and higher Hamming weights for BCH(2m, 5) codes by a close examination of the words of weight 5 and proves that the second generalized Hamming weight d2(C).
Wiretap networks II with partial information leakage
  • Zhixue Zhang
  • Computer Science
    2009 Fourth International Conference on Communications and Networking in China
  • 2009
TLDR
It is proved that the RNGHW of a nested code can completely characterize the security performance of the linear network code for the network.
Some new characters on the wire-tap channel of type II
TLDR
The generalized Hamming weight of Wei and the dimension/length profile (DLP) of Forney are extended to two-code formats and are useful to design a perfect secrecy coding scheme for the coordinated multiparty model.
Generalized Hamming weights of linear codes
TLDR
A generalized Griesmer bound for d/sub r/(C) is presented and examples are given of codes meeting this bound with equality, and in some cases exact expressions are derived.
Generalized Hamming weights for linear codes
  • V. Wei
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1991
TLDR
By viewing the minimum Hamming weight as a certain minimum property of one-dimensional subcodes, a generalized notion of higher-dimensional Hamming weights is obtained, which characterize the code performance on the wire-tap channel of type II.
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
TLDR
It is shown that, for RM codes, the standard binary order of bit positions is optimum at every bit position with respect to the state complexity of a minimal trellis diagram by using a theorem due to V.K. Wei (1991).
An application of the relative network Generalized Hamming weight to erroneous wiretap networks
This paper demonstrates that the relative network generalized Hamming weight (RNGHW) of a nested code fully characterizes the security performance of the corresponding nested coset coding scheme for
Dimension/length profiles and trellis complexity of linear block codes
  • G. Forney
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1994
This semi-tutorial paper discusses the connections between the dimension/length profile (DLP) of a linear code, which is essentially the same as its "generalized Hamming weight hierarchy", and the
...
...