中意绿色能源实验室建设事宜通报-InstituteofNetworkCoding.pptVIP

Bound Transformation (cont.) Bound Transformation (cont.) Generalized Singleton Bounds on RDLP and IRDLP Improving Generalized Singleton Bounds * An Application to Wiretap Channel * 4. Code Constructions and Existence Bounds Bounds can be achieved — Code constructions Bounds cannot be achieved — Good code pairs — Existence bounds Z. Zhuang, Y. Luo, B. Dai, ``Code constructions and existence bounds for relative generalized Hamming weight,” Des. Codes Cryptogr., published online, Apr. 2012. * Code Constructions Indirect construction: A technique of constructing code pairs meeting a bound from the existing ones. Direct construction: Focus on the structure of generator matrices with respect to code pairs meeting bounds. * Indirect Construction * Code Pair Equivalence and Canonical Forms * Direct Construction * * Code Pairs Meeting Weak Plotkin Bound * Code Pairs Meeting Weak Plotkin Bound (cont.) * Code Pairs Meeting Weak Plotkin Bound (cont.) * Code Pairs Meeting Weak Plotkin Bound (cont.) * Code Pairs Meeting Weak RCW Bound * Code Pairs Meeting Weak RCW Bound (cont.) * Good Code Pairs and Existence Bounds * First Existence Bound * Asymptotic Gilbert-Varshamov Bound * Second Existence Bound * Lower Bound on RLDP * Asymptotic Equivalence of Existence Bounds * Asymptotic Equivalence of Existence Bounds (cont.) * Validity of Existence Bounds * 感谢各位专家的莅临指导！ Upper Bounds on Relative Length/Dimension Profile Zhuojun Zhuang, Yuan Luo Shanghai Jiao Tong University INC. the Chinese Hong Kong University August 2012 Bounds on relative length/dimension profile (RLDP), the related bound refinement and transformation will be discussed. The results describe the security of the wiretap channel of type II and can also be applied to trellis complexity and secure network coding. RLDP is a generalization of the length/dimension profile (i.e. generalized Hamming weight) of a linear block code, one of the most famous concepts in coding theory. 1. Background 2. Upper Bounds on R