upper bounds on relative length/dimension profile
DESCRIPTION
Upper Bounds on Relative Length/Dimension Profile. Zhuojun Zhuang, Yuan Luo Shanghai Jiao Tong University INC. the Chinese Hong Kong University August 2012. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/1.jpg)
Upper Bounds on Relative Length/Dimension ProfileUpper Bounds on Relative Length/Dimension Profile
Zhuojun Zhuang, Yuan Luo
Shanghai Jiao Tong University
INC. the Chinese Hong Kong UniversityAugust 2012
![Page 2: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/2.jpg)
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.
![Page 3: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/3.jpg)
1. Background
2. Upper Bounds on RLDP
3. Bound Refinement and Transformation
Agenda
4. Code Constructions and Existence Bounds
![Page 4: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/4.jpg)
4
1. Background
The length/dimension profile (LDP) [Forney ‘94 IT], also referred as generalized Hamming weight (GHW) [Wei ‘91 IT], of a linear block code has been applied to trellis complexity (esp. in the satellite system of NASA), secure communication, multiple access communication and puncturing codes.
The relative length/dimension profile (RLDP) extends LDP and has been applied to secure communication [Luo ‘05 IT], trellis complexity [Zhuang ‘11 DCC] and secure network coding [Zhang ‘09 ChinaCom/ITW].
![Page 5: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/5.jpg)
5
[Forney ‘94 IT] G. D. Forney, ``Dimension/length profiles and trellis complexity of linear block codes,” IEEE Trans. Inform. Theory, vol. 40, no. 6, pp. 1741-1752, 1994.
[Wei ’91 IT] V. K. Wei, ``Generalized Hamming weights for linear codes,” IEEE Trans. Inform. Theory, vol. 37, no. 5, pp. 1412-1418, 1991.
[Luo ’05 IT] Y. Luo, C. Mitrpant, A. J. Han Vinck, K. F. Chen, ``Some new characters on the wire-tap channel of type II,” IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 1222-1229, 2005.
[Zhuang ’11 DCC] Z. Zhuang, Y. Luo, B. Dai, A. J. Han Vinck, ``On the relative profiles of a linear code and a subcode,” submitted to Des. Codes Cryptogr., under 2nd round review, 2011.
[Zhang ’09 ChinaCom] Z. Zhang, ``Wiretap networks II with partial information leakage,” in 4th International Conference on Communications and Networking in China, Xi’an, China, Aug. 2009, pp. 1-5.
[Zhang ’09 ITW] Z. Zhang, B. Zhuang, ``An application of the relative network generalized Hamming weight to erroneous wiretap networks,” in 2009 IEEE Information Theory Workshop, Taormina, Sicily, Italy, Oct. 2009, pp. 70-74.
![Page 6: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/6.jpg)
6
Wiretap Channel of Type II with Illegitimate Parties
![Page 7: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/7.jpg)
7
Coset Coding Scheme
![Page 8: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/8.jpg)
8
Security Analysis
![Page 9: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/9.jpg)
9
Subcode and Projection
![Page 10: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/10.jpg)
10
An Example
![Page 11: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/11.jpg)
11
Three Equivalent Concepts
![Page 12: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/12.jpg)
12
Three Equivalent Concepts (cont.)
![Page 13: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/13.jpg)
13
Bounds on Sequences
![Page 14: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/14.jpg)
14
Equivalence
![Page 15: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/15.jpg)
15
Upper Bounds on RLDP and Wiretap Channel
![Page 16: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/16.jpg)
16
2. Upper Bounds on RLDP
The bound cannot be achieved in most cases and the conditions for meeting it is rigid.Sharper bounds and code constructions?
Generalized Singleton bound
![Page 17: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/17.jpg)
17
Generalized Plotkin Bound
We say (C,C1) satisfying (4) meets the weak Plotkin bound.
![Page 18: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/18.jpg)
18
We shall see the refined generalized Plotkin bound on RLDP is always sharper than the generalized Singleton bound on RLDP.
![Page 19: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/19.jpg)
19
Generalized Griesmer Bound
![Page 20: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/20.jpg)
20
![Page 21: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/21.jpg)
21
![Page 22: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/22.jpg)
22
Relative Constant-Weight (RCW) Codes
![Page 23: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/23.jpg)
23
RCW Bound
We say (C,C1) satisfying (8) meets the weak RCW bound.
![Page 24: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/24.jpg)
24
If C1 is a zero code, both the RCW bound and the generalized Plotkin bound on RLDP (i.e. RGHW) reduce to the generalized Plotkin bound on LDP (i.e. GHW). Otherwise, the relation is uncertain.
![Page 25: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/25.jpg)
25
![Page 26: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/26.jpg)
26
3. Bound Refinement and Transformation
Bound Refinement
![Page 27: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/27.jpg)
27
Simple Refinement
Without loss of generality we can always assume u is strictly increasing.
![Page 28: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/28.jpg)
28
Refined Bounds and Generalized Singleton
Bound
![Page 29: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/29.jpg)
29
Bound Transformation
![Page 30: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/30.jpg)
Bound Transformation (cont.)
![Page 31: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/31.jpg)
Bound Transformation (cont.)
![Page 32: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/32.jpg)
Generalized Singleton Bounds on RDLP and IRDLP
![Page 33: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/33.jpg)
Improving Generalized Singleton Bounds
![Page 34: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/34.jpg)
![Page 35: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/35.jpg)
![Page 36: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/36.jpg)
36
An Application to Wiretap Channel
![Page 37: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/37.jpg)
37
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.
![Page 38: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/38.jpg)
38
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.
![Page 39: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/39.jpg)
39
Indirect Construction
![Page 40: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/40.jpg)
40
Code Pair Equivalence and
Canonical Forms
![Page 41: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/41.jpg)
41
Direct Construction
![Page 42: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/42.jpg)
42
![Page 43: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/43.jpg)
43
Code Pairs Meeting Weak Plotkin Bound
![Page 44: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/44.jpg)
44
Code Pairs Meeting Weak Plotkin Bound (cont.)
![Page 45: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/45.jpg)
45
Code Pairs Meeting Weak Plotkin Bound (cont.)
![Page 46: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/46.jpg)
46
Code Pairs Meeting Weak Plotkin Bound (cont.)
![Page 47: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/47.jpg)
47
Code Pairs Meeting Weak RCW Bound
![Page 48: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/48.jpg)
48
Code Pairs Meeting Weak RCW Bound (cont.)
![Page 49: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/49.jpg)
49
Good Code Pairs and Existence Bounds
![Page 50: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/50.jpg)
50
First Existence Bound
![Page 51: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/51.jpg)
51
Asymptotic Gilbert-Varshamov Bound
![Page 52: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/52.jpg)
52
Second Existence Bound
![Page 53: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/53.jpg)
53
Lower Bound on RLDP
![Page 54: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/54.jpg)
54
Asymptotic Equivalence of Existence Bounds
![Page 55: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/55.jpg)
55
Asymptotic Equivalence of Existence Bounds
(cont.)
![Page 56: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/56.jpg)
56
Validity of Existence Bounds
![Page 57: Upper Bounds on Relative Length/Dimension Profile](https://reader036.vdocument.in/reader036/viewer/2022081603/5681584e550346895dc5ab06/html5/thumbnails/57.jpg)