IEEE Transactions on Information Theory
- Vol: 22 Issue: 1
- Vol: 22 Issue: 2
- Vol: 22 Issue: 3
- Vol: 22 Issue: 4
- Vol: 22 Issue: 5
- Vol: 22 Issue: 6
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 19 Issue: 1
- Vol: 19 Issue: 2
- Vol: 19 Issue: 3
- Vol: 19 Issue: 4
- Vol: 19 Issue: 5
- Vol: 19 Issue: 6
- Vol: 18 Issue: 1
- Vol: 18 Issue: 2
- Vol: 18 Issue: 3
- Vol: 18 Issue: 4
- Vol: 18 Issue: 5
- Vol: 18 Issue: 6
- Vol: 17 Issue: 1
- Vol: 17 Issue: 2
- Vol: 17 Issue: 3
- Vol: 17 Issue: 4
- Vol: 17 Issue: 5
- Vol: 17 Issue: 6
- Vol: 16 Issue: 1
- Vol: 16 Issue: 2
- Vol: 16 Issue: 3
- Vol: 16 Issue: 4
- Vol: 16 Issue: 5
- Vol: 16 Issue: 6
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 24 Issue: 1
- Vol: 24 Issue: 2
- Vol: 24 Issue: 3
- Vol: 24 Issue: 4
- Vol: 24 Issue: 5
- Vol: 24 Issue: 6
- Vol: 23 Issue: 1
- Vol: 23 Issue: 2
- Vol: 23 Issue: 3
- Vol: 23 Issue: 4
- Vol: 23 Issue: 5
- Vol: 23 Issue: 6
- Vol: 47 Issue: 1
- Vol: 47 Issue: 2
- Vol: 47 Issue: 3
- Vol: 47 Issue: 4
- Vol: 47 Issue: 5
- Vol: 47 Issue: 6
- Vol: 47 Issue: 7
- Vol: 36 Issue: 1
- Vol: 36 Issue: 2
- Vol: 36 Issue: 3
- Vol: 36 Issue: 4
- Vol: 36 Issue: 5
- Vol: 36 Issue: 6
- Vol: 46 Issue: 1
- Vol: 46 Issue: 2
- Vol: 46 Issue: 3
- Vol: 46 Issue: 4
- Vol: 46 Issue: 5
- Vol: 46 Issue: 6
- Vol: 46 Issue: 7
- Vol: 33 Issue: 1
- Vol: 33 Issue: 2
- Vol: 33 Issue: 3
- Vol: 33 Issue: 4
- Vol: 33 Issue: 5
- Vol: 33 Issue: 6
- Vol: 32 Issue: 1
- Vol: 32 Issue: 2
- Vol: 32 Issue: 3
- Vol: 32 Issue: 4
- Vol: 32 Issue: 5
- Vol: 32 Issue: 6
- Vol: 31 Issue: 1
- Vol: 31 Issue: 2
- Vol: 31 Issue: 3
- Vol: 31 Issue: 4
- Vol: 31 Issue: 5
- Vol: 31 Issue: 6
- Vol: 30 Issue: 1
- Vol: 30 Issue: 2
- Vol: 30 Issue: 3
- Vol: 30 Issue: 4
- Vol: 30 Issue: 5
- Vol: 30 Issue: 6
- Vol: 29 Issue: 1
- Vol: 29 Issue: 2
- Vol: 29 Issue: 3
- Vol: 29 Issue: 4
- Vol: 29 Issue: 5
- Vol: 29 Issue: 6
- Vol: 28 Issue: 1
- Vol: 28 Issue: 2
- Vol: 28 Issue: 3
- Vol: 28 Issue: 4
- Vol: 28 Issue: 5
- Vol: 28 Issue: 6
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 35 Issue: 1
- Vol: 35 Issue: 2
- Vol: 35 Issue: 3
- Vol: 35 Issue: 4
- Vol: 35 Issue: 5
- Vol: 35 Issue: 6
- Vol: 34 Issue: 1
- Vol: 34 Issue: 2
- Vol: 34 Issue: 3
- Vol: 34 Issue: 4
- Vol: 34 Issue: 5 Part: 1
- Vol: 34 Issue: 6
- Vol: 58 Issue: 1
- Vol: 58 Issue: 2
- Vol: 58 Issue: 3
- Vol: 58 Issue: 4
- Vol: 58 Issue: 5
- Vol: 58 Issue: 6
- Vol: 58 Issue: 7
- Vol: 58 Issue: 8
- Vol: 58 Issue: 9
- Vol: 58 Issue: 10
- Vol: 58 Issue: 11
- Vol: 58 Issue: 12
- Vol: 57 Issue: 1
- Vol: 57 Issue: 2
- Vol: 57 Issue: 3
- Vol: 57 Issue: 4
- Vol: 57 Issue: 5
- Vol: 57 Issue: 6
- Vol: 57 Issue: 7
- Vol: 57 Issue: 8
- Vol: 57 Issue: 9
- Vol: 57 Issue: 10
- Vol: 57 Issue: 11
- Vol: 57 Issue: 12
- Vol: 56 Issue: 1
- Vol: 56 Issue: 2
- Vol: 56 Issue: 3
- Vol: 56 Issue: 4
- Vol: 56 Issue: 5
- Vol: 56 Issue: 6
- Vol: 56 Issue: 7
- Vol: 56 Issue: 8
- Vol: 56 Issue: 9
- Vol: 56 Issue: 10
- Vol: 56 Issue: 11
- Vol: 56 Issue: 12
- Vol: 55 Issue: 1
- Vol: 55 Issue: 2
- Vol: 55 Issue: 3
- Vol: 55 Issue: 4
- Vol: 55 Issue: 5
- Vol: 55 Issue: 6
- Vol: 55 Issue: 7
- Vol: 55 Issue: 8
- Vol: 55 Issue: 9
- Vol: 55 Issue: 10
- Vol: 55 Issue: 11
- Vol: 55 Issue: 12
- Vol: 44 Issue: 1
- Vol: 44 Issue: 2
- Vol: 44 Issue: 3
- Vol: 44 Issue: 4
- Vol: 44 Issue: 5
- Vol: 44 Issue: 6
- Vol: 44 Issue: 7
- Vol: 54 Issue: 1
- Vol: 54 Issue: 2
- Vol: 54 Issue: 3
- Vol: 54 Issue: 4
- Vol: 54 Issue: 5
- Vol: 54 Issue: 6
- Vol: 54 Issue: 7
- Vol: 54 Issue: 8
- Vol: 54 Issue: 9
- Vol: 54 Issue: 10
- Vol: 54 Issue: 11
- Vol: 54 Issue: 12
- Vol: 43 Issue: 1
- Vol: 43 Issue: 2
- Vol: 43 Issue: 3
- Vol: 43 Issue: 4
- Vol: 43 Issue: 5
- Vol: 43 Issue: 6
- Vol: 53 Issue: 1
- Vol: 53 Issue: 2
- Vol: 53 Issue: 3
- Vol: 53 Issue: 4
- Vol: 53 Issue: 5
- Vol: 53 Issue: 6
- Vol: 53 Issue: 7
- Vol: 53 Issue: 8
- Vol: 53 Issue: 9
- Vol: 53 Issue: 10
- Vol: 53 Issue: 11
- Vol: 53 Issue: 12
- Vol: 42 Issue: 1
- Vol: 42 Issue: 2
- Vol: 42 Issue: 3
- Vol: 42 Issue: 4
- Vol: 42 Issue: 5
- Vol: 42 Issue: 6 Part: 1
- Vol: 42 Issue: 6 Part: 2
- Vol: 52 Issue: 1
- Vol: 52 Issue: 2
- Vol: 52 Issue: 3
- Vol: 52 Issue: 4
- Vol: 52 Issue: 5
- Vol: 52 Issue: 6
- Vol: 52 Issue: 7
- Vol: 52 Issue: 8
- Vol: 52 Issue: 9
- Vol: 52 Issue: 10
- Vol: 52 Issue: 11
- Vol: 52 Issue: 12
- Vol: 41 Issue: 1
- Vol: 41 Issue: 2
- Vol: 41 Issue: 3
- Vol: 41 Issue: 4
- Vol: 41 Issue: 5
- Vol: 41 Issue: 6 Part: 1
- Vol: 41 Issue: 6 Part: 2
- Vol: 51 Issue: 1
- Vol: 51 Issue: 2
- Vol: 51 Issue: 3
- Vol: 51 Issue: 4
- Vol: 51 Issue: 5
- Vol: 51 Issue: 6
- Vol: 51 Issue: 7
- Vol: 51 Issue: 8
- Vol: 51 Issue: 9
- Vol: 51 Issue: 10
- Vol: 51 Issue: 11
- Vol: 51 Issue: 12
- Vol: 40 Issue: 1
- Vol: 40 Issue: 2
- Vol: 40 Issue: 3
- Vol: 40 Issue: 4
- Vol: 40 Issue: 5
- Vol: 40 Issue: 6
- Vol: 50 Issue: 1
- Vol: 50 Issue: 2
- Vol: 50 Issue: 3
- Vol: 50 Issue: 4
- Vol: 50 Issue: 5
- Vol: 50 Issue: 6
- Vol: 50 Issue: 7
- Vol: 50 Issue: 8
- Vol: 50 Issue: 9
- Vol: 50 Issue: 10
- Vol: 50 Issue: 11
- Vol: 50 Issue: 12
- Vol: 39 Issue: 1
- Vol: 39 Issue: 2
- Vol: 39 Issue: 3
- Vol: 39 Issue: 4
- Vol: 39 Issue: 5
- Vol: 39 Issue: 6
- Vol: 49 Issue: 1
- Vol: 49 Issue: 2
- Vol: 49 Issue: 3
- Vol: 49 Issue: 4
- Vol: 49 Issue: 5
- Vol: 49 Issue: 6
- Vol: 49 Issue: 7
- Vol: 49 Issue: 8
- Vol: 49 Issue: 9
- Vol: 49 Issue: 10
- Vol: 49 Issue: 11
- Vol: 49 Issue: 12
- Vol: 38 Issue: 1
- Vol: 38 Issue: 2
- Vol: 38 Issue: 3
- Vol: 38 Issue: 4
- Vol: 38 Issue: 5
- Vol: 38 Issue: 6
- Vol: 48 Issue: 1
- Vol: 48 Issue: 2
- Vol: 48 Issue: 3
- Vol: 48 Issue: 4
- Vol: 48 Issue: 5
- Vol: 48 Issue: 6
- Vol: 48 Issue: 7
- Vol: 48 Issue: 8
- Vol: 48 Issue: 9
- Vol: 48 Issue: 10
- Vol: 48 Issue: 11
- Vol: 48 Issue: 12
- Vol: 37 Issue: 1
- Vol: 37 Issue: 2
- Vol: 37 Issue: 3
- Vol: 37 Issue: 4
- Vol: 37 Issue: 5
- Vol: 37 Issue: 6
- Vol: 45 Issue: 1
- Vol: 45 Issue: 2
- Vol: 45 Issue: 3
- Vol: 45 Issue: 4
- Vol: 45 Issue: 5
- Vol: 45 Issue: 6
- Vol: 45 Issue: 7
- Vol: 64 Issue: 1
- Vol: 64 Issue: 2
- Vol: 64 Issue: 3
- Vol: 64 Issue: 4 Part: 1
- Vol: 64 Issue: 4 Part: 2
- Vol: 63 Issue: 1
- Vol: 63 Issue: 2
- Vol: 63 Issue: 3
- Vol: 63 Issue: 4
- Vol: 63 Issue: 5
- Vol: 63 Issue: 6
- Vol: 63 Issue: 7
- Vol: 63 Issue: 8
- Vol: 63 Issue: 9
- Vol: 63 Issue: 10
- Vol: 63 Issue: 11
- Vol: 63 Issue: 12
- Vol: 62 Issue: 1
- Vol: 62 Issue: 2
- Vol: 62 Issue: 3
- Vol: 62 Issue: 4
- Vol: 62 Issue: 5
- Vol: 62 Issue: 6
- Vol: 62 Issue: 7
- Vol: 62 Issue: 8
- Vol: 62 Issue: 9
- Vol: 62 Issue: 10
- Vol: 62 Issue: 11
- Vol: 62 Issue: 12
- Vol: 61 Issue: 1
- Vol: 61 Issue: 2
- Vol: 61 Issue: 3
- Vol: 61 Issue: 4
- Vol: 61 Issue: 5
- Vol: 61 Issue: 6
- Vol: 61 Issue: 7
- Vol: 61 Issue: 8
- Vol: 61 Issue: 9
- Vol: 61 Issue: 10
- Vol: 61 Issue: 11
- Vol: 61 Issue: 12
- Vol: 60 Issue: 1
- Vol: 60 Issue: 2
- Vol: 60 Issue: 3
- Vol: 60 Issue: 4
- Vol: 60 Issue: 5
- Vol: 60 Issue: 6
- Vol: 60 Issue: 7
- Vol: 60 Issue: 8
- Vol: 60 Issue: 9
- Vol: 60 Issue: 10
- Vol: 60 Issue: 11
- Vol: 60 Issue: 12
- Vol: 59 Issue: 1
- Vol: 59 Issue: 2
- Vol: 59 Issue: 3
- Vol: 59 Issue: 4
- Vol: 59 Issue: 5
- Vol: 59 Issue: 6
- Vol: 59 Issue: 7
- Vol: 59 Issue: 8
- Vol: 59 Issue: 9
- Vol: 59 Issue: 10
- Vol: 59 Issue: 11
- Vol: 59 Issue: 12
- Vol: 15 Issue: 1
- Vol: 15 Issue: 2
- Vol: 15 Issue: 3
- Vol: 15 Issue: 4
- Vol: 15 Issue: 5
- Vol: 15 Issue: 6
- Vol: 22 Issue: 1
- Vol: 22 Issue: 2
- Vol: 22 Issue: 3
- Vol: 22 Issue: 4
- Vol: 22 Issue: 5
- Vol: 22 Issue: 6
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 19 Issue: 1
- Vol: 19 Issue: 2
- Vol: 19 Issue: 3
- Vol: 19 Issue: 4
- Vol: 19 Issue: 5
- Vol: 19 Issue: 6
- Vol: 18 Issue: 1
- Vol: 18 Issue: 2
- Vol: 18 Issue: 3
- Vol: 18 Issue: 4
- Vol: 18 Issue: 5
- Vol: 18 Issue: 6
- Vol: 17 Issue: 1
- Vol: 17 Issue: 2
- Vol: 17 Issue: 3
- Vol: 17 Issue: 4
- Vol: 17 Issue: 5
- Vol: 17 Issue: 6
- Vol: 16 Issue: 1
- Vol: 16 Issue: 2
- Vol: 16 Issue: 3
- Vol: 16 Issue: 4
- Vol: 16 Issue: 5
- Vol: 16 Issue: 6
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 24 Issue: 1
- Vol: 24 Issue: 2
- Vol: 24 Issue: 3
- Vol: 24 Issue: 4
- Vol: 24 Issue: 5
- Vol: 24 Issue: 6
- Vol: 23 Issue: 1
- Vol: 23 Issue: 2
- Vol: 23 Issue: 3
- Vol: 23 Issue: 4
- Vol: 23 Issue: 5
- Vol: 23 Issue: 6
- Vol: 47 Issue: 1
- Vol: 47 Issue: 2
- Vol: 47 Issue: 3
- Vol: 47 Issue: 4
- Vol: 47 Issue: 5
- Vol: 47 Issue: 6
- Vol: 47 Issue: 7
- Vol: 36 Issue: 1
- Vol: 36 Issue: 2
- Vol: 36 Issue: 3
- Vol: 36 Issue: 4
- Vol: 36 Issue: 5
- Vol: 36 Issue: 6
- Vol: 46 Issue: 1
- Vol: 46 Issue: 2
- Vol: 46 Issue: 3
- Vol: 46 Issue: 4
- Vol: 46 Issue: 5
- Vol: 46 Issue: 6
- Vol: 46 Issue: 7
- Vol: 33 Issue: 1
- Vol: 33 Issue: 2
- Vol: 33 Issue: 3
- Vol: 33 Issue: 4
- Vol: 33 Issue: 5
- Vol: 33 Issue: 6
- Vol: 32 Issue: 1
- Vol: 32 Issue: 2
- Vol: 32 Issue: 3
- Vol: 32 Issue: 4
- Vol: 32 Issue: 5
- Vol: 32 Issue: 6
- Vol: 31 Issue: 1
- Vol: 31 Issue: 2
- Vol: 31 Issue: 3
- Vol: 31 Issue: 4
- Vol: 31 Issue: 5
- Vol: 31 Issue: 6
- Vol: 30 Issue: 1
- Vol: 30 Issue: 2
- Vol: 30 Issue: 3
- Vol: 30 Issue: 4
- Vol: 30 Issue: 5
- Vol: 30 Issue: 6
- Vol: 29 Issue: 1
- Vol: 29 Issue: 2
- Vol: 29 Issue: 3
- Vol: 29 Issue: 4
- Vol: 29 Issue: 5
- Vol: 29 Issue: 6
- Vol: 28 Issue: 1
- Vol: 28 Issue: 2
- Vol: 28 Issue: 3
- Vol: 28 Issue: 4
- Vol: 28 Issue: 5
- Vol: 28 Issue: 6
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 35 Issue: 1
- Vol: 35 Issue: 2
- Vol: 35 Issue: 3
- Vol: 35 Issue: 4
- Vol: 35 Issue: 5
- Vol: 35 Issue: 6
- Vol: 34 Issue: 1
- Vol: 34 Issue: 2
- Vol: 34 Issue: 3
- Vol: 34 Issue: 4
- Vol: 34 Issue: 5 Part: 1
- Vol: 34 Issue: 6
- Vol: 58 Issue: 1
- Vol: 58 Issue: 2
- Vol: 58 Issue: 3
- Vol: 58 Issue: 4
- Vol: 58 Issue: 5
- Vol: 58 Issue: 6
- Vol: 58 Issue: 7
- Vol: 58 Issue: 8
- Vol: 58 Issue: 9
- Vol: 58 Issue: 10
- Vol: 58 Issue: 11
- Vol: 58 Issue: 12
- Vol: 57 Issue: 1
- Vol: 57 Issue: 2
- Vol: 57 Issue: 3
- Vol: 57 Issue: 4
- Vol: 57 Issue: 5
- Vol: 57 Issue: 6
- Vol: 57 Issue: 7
- Vol: 57 Issue: 8
- Vol: 57 Issue: 9
- Vol: 57 Issue: 10
- Vol: 57 Issue: 11
- Vol: 57 Issue: 12
- Vol: 56 Issue: 1
- Vol: 56 Issue: 2
- Vol: 56 Issue: 3
- Vol: 56 Issue: 4
- Vol: 56 Issue: 5
- Vol: 56 Issue: 6
- Vol: 56 Issue: 7
- Vol: 56 Issue: 8
- Vol: 56 Issue: 9
- Vol: 56 Issue: 10
- Vol: 56 Issue: 11
- Vol: 56 Issue: 12
- Vol: 55 Issue: 1
- Vol: 55 Issue: 2
- Vol: 55 Issue: 3
- Vol: 55 Issue: 4
- Vol: 55 Issue: 5
- Vol: 55 Issue: 6
- Vol: 55 Issue: 7
- Vol: 55 Issue: 8
- Vol: 55 Issue: 9
- Vol: 55 Issue: 10
- Vol: 55 Issue: 11
- Vol: 55 Issue: 12
- Vol: 44 Issue: 1
- Vol: 44 Issue: 2
- Vol: 44 Issue: 3
- Vol: 44 Issue: 4
- Vol: 44 Issue: 5
- Vol: 44 Issue: 6
- Vol: 44 Issue: 7
- Vol: 54 Issue: 1
- Vol: 54 Issue: 2
- Vol: 54 Issue: 3
- Vol: 54 Issue: 4
- Vol: 54 Issue: 5
- Vol: 54 Issue: 6
- Vol: 54 Issue: 7
- Vol: 54 Issue: 8
- Vol: 54 Issue: 9
- Vol: 54 Issue: 10
- Vol: 54 Issue: 11
- Vol: 54 Issue: 12
- Vol: 43 Issue: 1
- Vol: 43 Issue: 2
- Vol: 43 Issue: 3
- Vol: 43 Issue: 4
- Vol: 43 Issue: 5
- Vol: 43 Issue: 6
- Vol: 53 Issue: 1
- Vol: 53 Issue: 2
- Vol: 53 Issue: 3
- Vol: 53 Issue: 4
- Vol: 53 Issue: 5
- Vol: 53 Issue: 6
- Vol: 53 Issue: 7
- Vol: 53 Issue: 8
- Vol: 53 Issue: 9
- Vol: 53 Issue: 10
- Vol: 53 Issue: 11
- Vol: 53 Issue: 12
- Vol: 42 Issue: 1
- Vol: 42 Issue: 2
- Vol: 42 Issue: 3
- Vol: 42 Issue: 4
- Vol: 42 Issue: 5
- Vol: 42 Issue: 6 Part: 1
- Vol: 42 Issue: 6 Part: 2
- Vol: 52 Issue: 1
- Vol: 52 Issue: 2
- Vol: 52 Issue: 3
- Vol: 52 Issue: 4
- Vol: 52 Issue: 5
- Vol: 52 Issue: 6
- Vol: 52 Issue: 7
- Vol: 52 Issue: 8
- Vol: 52 Issue: 9
- Vol: 52 Issue: 10
- Vol: 52 Issue: 11
- Vol: 52 Issue: 12
- Vol: 41 Issue: 1
- Vol: 41 Issue: 2
- Vol: 41 Issue: 3
- Vol: 41 Issue: 4
- Vol: 41 Issue: 5
- Vol: 41 Issue: 6 Part: 1
- Vol: 41 Issue: 6 Part: 2
- Vol: 51 Issue: 1
- Vol: 51 Issue: 2
- Vol: 51 Issue: 3
- Vol: 51 Issue: 4
- Vol: 51 Issue: 5
- Vol: 51 Issue: 6
- Vol: 51 Issue: 7
- Vol: 51 Issue: 8
- Vol: 51 Issue: 9
- Vol: 51 Issue: 10
- Vol: 51 Issue: 11
- Vol: 51 Issue: 12
- Vol: 40 Issue: 1
- Vol: 40 Issue: 2
- Vol: 40 Issue: 3
- Vol: 40 Issue: 4
- Vol: 40 Issue: 5
- Vol: 40 Issue: 6
- Vol: 50 Issue: 1
- Vol: 50 Issue: 2
- Vol: 50 Issue: 3
- Vol: 50 Issue: 4
- Vol: 50 Issue: 5
- Vol: 50 Issue: 6
- Vol: 50 Issue: 7
- Vol: 50 Issue: 8
- Vol: 50 Issue: 9
- Vol: 50 Issue: 10
- Vol: 50 Issue: 11
- Vol: 50 Issue: 12
- Vol: 39 Issue: 1
- Vol: 39 Issue: 2
- Vol: 39 Issue: 3
- Vol: 39 Issue: 4
- Vol: 39 Issue: 5
- Vol: 39 Issue: 6
- Vol: 49 Issue: 1
- Vol: 49 Issue: 2
- Vol: 49 Issue: 3
- Vol: 49 Issue: 4
- Vol: 49 Issue: 5
- Vol: 49 Issue: 6
- Vol: 49 Issue: 7
- Vol: 49 Issue: 8
- Vol: 49 Issue: 9
- Vol: 49 Issue: 10
- Vol: 49 Issue: 11
- Vol: 49 Issue: 12
- Vol: 38 Issue: 1
- Vol: 38 Issue: 2
- Vol: 38 Issue: 3
- Vol: 38 Issue: 4
- Vol: 38 Issue: 5
- Vol: 38 Issue: 6
- Vol: 48 Issue: 1
- Vol: 48 Issue: 2
- Vol: 48 Issue: 3
- Vol: 48 Issue: 4
- Vol: 48 Issue: 5
- Vol: 48 Issue: 6
- Vol: 48 Issue: 7
- Vol: 48 Issue: 8
- Vol: 48 Issue: 9
- Vol: 48 Issue: 10
- Vol: 48 Issue: 11
- Vol: 48 Issue: 12
- Vol: 37 Issue: 1
- Vol: 37 Issue: 2
- Vol: 37 Issue: 3
- Vol: 37 Issue: 4
- Vol: 37 Issue: 5
- Vol: 37 Issue: 6
- Vol: 45 Issue: 1
- Vol: 45 Issue: 2
- Vol: 45 Issue: 3
- Vol: 45 Issue: 4
- Vol: 45 Issue: 5
- Vol: 45 Issue: 6
- Vol: 45 Issue: 7
- Vol: 64 Issue: 1
- Vol: 64 Issue: 2
- Vol: 64 Issue: 3
- Vol: 64 Issue: 4 Part: 1
- Vol: 64 Issue: 4 Part: 2
- Vol: 63 Issue: 1
- Vol: 63 Issue: 2
- Vol: 63 Issue: 3
- Vol: 63 Issue: 4
- Vol: 63 Issue: 5
- Vol: 63 Issue: 6
- Vol: 63 Issue: 7
- Vol: 63 Issue: 8
- Vol: 63 Issue: 9
- Vol: 63 Issue: 10
- Vol: 63 Issue: 11
- Vol: 63 Issue: 12
- Vol: 62 Issue: 1
- Vol: 62 Issue: 2
- Vol: 62 Issue: 3
- Vol: 62 Issue: 4
- Vol: 62 Issue: 5
- Vol: 62 Issue: 6
- Vol: 62 Issue: 7
- Vol: 62 Issue: 8
- Vol: 62 Issue: 9
- Vol: 62 Issue: 10
- Vol: 62 Issue: 11
- Vol: 62 Issue: 12
- Vol: 61 Issue: 1
- Vol: 61 Issue: 2
- Vol: 61 Issue: 3
- Vol: 61 Issue: 4
- Vol: 61 Issue: 5
- Vol: 61 Issue: 6
- Vol: 61 Issue: 7
- Vol: 61 Issue: 8
- Vol: 61 Issue: 9
- Vol: 61 Issue: 10
- Vol: 61 Issue: 11
- Vol: 61 Issue: 12
- Vol: 60 Issue: 1
- Vol: 60 Issue: 2
- Vol: 60 Issue: 3
- Vol: 60 Issue: 4
- Vol: 60 Issue: 5
- Vol: 60 Issue: 6
- Vol: 60 Issue: 7
- Vol: 60 Issue: 8
- Vol: 60 Issue: 9
- Vol: 60 Issue: 10
- Vol: 60 Issue: 11
- Vol: 60 Issue: 12
- Vol: 59 Issue: 1
- Vol: 59 Issue: 2
- Vol: 59 Issue: 3
- Vol: 59 Issue: 4
- Vol: 59 Issue: 5
- Vol: 59 Issue: 6
- Vol: 59 Issue: 7
- Vol: 59 Issue: 8
- Vol: 59 Issue: 9
- Vol: 59 Issue: 10
- Vol: 59 Issue: 11
- Vol: 59 Issue: 12
- Vol: 15 Issue: 1
- Vol: 15 Issue: 2
- Vol: 15 Issue: 3
- Vol: 15 Issue: 4
- Vol: 15 Issue: 5
- Vol: 15 Issue: 6
Volume 59 Issue 10 • Oct. 2013
Sponsor
Filter Results
Previous Titles
- ( 1955 - 1962 ) IRE Transactions on Information Theory
- ( 1953 - 1954 ) Transactions of the IRE Professional Group on Information Theory
-
-
IEEE Transactions on Information Theory publication information
|
PDF (142 KB)
-
Capacity Region of Cooperative Multiple-Access Channel With States
Publication Year: 2013, Page(s):6153 - 6174
Cited by: Papers (13)We consider a two-user state-dependent multiaccess channel in which the states of the channel are known noncausally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states noncausally transmits an individual message. We find explicit characterizations of the capacity region of this communica... View full abstract»
-
An Achievable Rate Region for the Broadcast Channel With Feedback
Publication Year: 2013, Page(s):6175 - 6191
Cited by: Papers (13)A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding using Marton's coding scheme for the broadcast channel without feedback as the starting point. If the message rates in the Marton scheme are too high to be decoded at the end of a block, each receiver... View full abstract»
-
Optimal Coding for the Binary Deletion Channel With Small Deletion Probability
Publication Year: 2013, Page(s):6192 - 6219
Cited by: Papers (10)The binary deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when they are not deleted, they are not affected by the channel. Despite significant effort, little is known about the capacity of this channel and even less about optimal coding schemes. In this paper, we develop a new s... View full abstract»
-
Universal Estimation of Directed Information
Publication Year: 2013, Page(s):6220 - 6242
Cited by: Papers (24)Four estimators of the directed information rate between a pair of jointly stationary ergodic finite-alphabet processes are proposed, based on universal probability assignments. The first one is a Shannon-McMillan-Breiman-type estimator, similar to those used by Verdú in 2005 and Cai in 2006 for estimation of other information measures. We show the almost sure and L1 convergence properties... View full abstract»
-
Feedback Communication and Control Over a Single Channel
Publication Year: 2013, Page(s):6243 - 6257This paper explores the problem of feedback coding for a channel whose output is simultaneously used for two purposes: it is decoded to establish reliable communication, and it is used to control a dynamical system. In general, there is a tradeoff between the rate of communication and the accuracy of control. An intuitive communication and control strategy is analyzed and shown to be optimal in se... View full abstract»
-
A Constrained Coding Approach to Error-Free Half-Duplex Relay Networks
Publication Year: 2013, Page(s):6258 - 6260
Cited by: Papers (1)We show that the broadcast capacity of an infinite-depth tree-structured network of error-free half-duplex-constrained relays can be achieved using constrained coding at the source and symbol forwarding at the relays. View full abstract»
-
Likelihood Ratios and Inference for Poisson Channels
Publication Year: 2013, Page(s):6261 - 6272In recent years, infinite-dimensional methods have been introduced for Gaussian channel estimation. The aim of this paper is to study the application of similar methods to Poisson channels. In particular, we compute the noncausal conditional mean estimator of a Poisson channel using the likelihood ratio and the discrete Malliavin gradient. This algorithm is suitable for numerical implementation vi... View full abstract»
-
Information Theory of DNA Shotgun Sequencing
Publication Year: 2013, Page(s):6273 - 6289
Cited by: Papers (19)DNA sequencing is the basic workhorse of modern day biology and medicine. Shotgun sequencing is the dominant technique used: many randomly located short fragments called reads are extracted from the DNA sequence, and these reads are assembled to reconstruct the original sequence. A basic question is: given a sequencing technology and the statistics of the DNA sequence, what is the minimum number o... View full abstract»
-
Parallel Opportunistic Routing in Wireless Networks
Publication Year: 2013, Page(s):6290 - 6300
Cited by: Papers (31)We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source-destination pairs increases up to the operating maximum. Our opportunistic routing is novel in a sense that it is massively parallel, i.e., it is performed by many nodes simultaneously to maximize the opportunistic gain while controllin... View full abstract»
-
Markov Approximation for Combinatorial Network Optimization
Publication Year: 2013, Page(s):6301 - 6327
Cited by: Papers (33)Many important network design problems are fundamentally combinatorial optimization problems. A large number of such problems, however, cannot readily be tackled by distributed algorithms. The Markov approximation framework studied in this paper is a general technique for synthesizing distributed algorithms. We show that when using the log-sum-exp function to approximate the optimal value of any c... View full abstract»
-
Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting
Publication Year: 2013, Page(s):6328 - 6341
Cited by: Papers (21)In an unreliable single-hop broadcast network setting, we investigate the throughput and decoding-delay performance of random linear network coding as a function of the coding window size and the network size. Our model consists of a source transmitting packets of a single flow to a set of n users over independent time-correlated erasure channels. The source performs random linear network coding (... View full abstract»
-
Modular Methodology for the Network Calculus in a Time-Varying Context
Publication Year: 2013, Page(s):6342 - 6356Network calculus (NC) is a set of rules and results for computing bounds for performance parameters of communication systems, such as end-to-end delay, maximum backlog, and service curves. Previous works show that the problem of determining performance bounds of communication networks is simplified if modeled using the dioid algebra. In this paper, we propose a methodology that allows the treatmen... View full abstract»
-
On the Stability of Finite Queue Slotted Aloha Protocol
Publication Year: 2013, Page(s):6357 - 6366
Cited by: Papers (7)We revisit the stability analysis of the well-known slotted Aloha protocol with a finite number of queues. Under standard modeling assumptions, we derive a sufficient condition for the stability by applying a positive recurrence criterion due to Rosberg (JAP, vol. 17, no. 3, 1980). Our sufficiency condition for stability is linear in arrival rates and does not require knowledge of the stationary j... View full abstract»
-
On the Queue-Overflow Probability of Wireless Systems: A New Approach Combining Large Deviations With Lyapunov Functions
Publication Year: 2013, Page(s):6367 - 6392
Cited by: Papers (5)In this paper, we study the queue-overflow probability of wireless scheduling algorithms. In wireless networks operated under queue-length-based scheduling algorithms, there often exists a tight coupling between the service-rate process, the system backlog process, the arrival process, and the stochastic process governing channel variations. Although one can use sample-path large-deviation techniq... View full abstract»
-
The Impact of Queue Length Information on Buffer Overflow in Parallel Queues
Publication Year: 2013, Page(s):6393 - 6404
Cited by: Papers (3)We consider a system consisting of N parallel queues, served by one server. Time is slotted, and the server serves one of the queues in each time slot, according to some scheduling policy. We first characterize the exponent of the buffer overflow probability and the most likely overflow trajectories under the Longest Queue First (LQF) scheduling policy. Under statistically identical arrivals to ea... View full abstract»
-
Capacity of a Class of Linear Binary Field Multisource Relay Networks
Publication Year: 2013, Page(s):6405 - 6420
Cited by: Papers (12)In this paper, we study a layered linear binary field network with time-varying channels, which is a simplified model reflecting broadcast, interference, and fading natures of wireless communications. We observe that fading can play an important role in mitigating interuser interference effectively for both single-hop and multihop networks. We propose new coding schemes with randomized ergodic cha... View full abstract»
-
Multiple-Input Multiple-Output Two-Way Relaying: A Space-Division Approach
Publication Year: 2013, Page(s):6421 - 6440
Cited by: Papers (36)We propose a novel space-division-based network-coding scheme for multiple-input multiple-output (MIMO) two-way relay channels (TWRCs), in which two multiantenna users exchange information via a multiantenna relay. In the proposed scheme, the overall signal space at the relay is divided into two subspaces. In one subspace, the spatial streams of the two users have nearly orthogonal directions and ... View full abstract»
-
Joint Spatial Division and Multiplexing—The Large-Scale Array Regime
Publication Year: 2013, Page(s):6441 - 6463
Cited by: Papers (318) | Patents (4)We propose joint spatial division and multiplexing (JSDM), an approach to multiuser MIMO downlink that exploits the structure of the correlation of the channel vectors in order to allow for a large number of antennas at the base station while requiring reduced-dimensional channel state information at the transmitter (CSIT). JSDM achieves significant savings both in the downlink training and in the... View full abstract»
-
Statistical Beamforming on the Grassmann Manifold for the Two-User Broadcast Channel
Publication Year: 2013, Page(s):6464 - 6489
Cited by: Papers (28)A Rayleigh fading spatially correlated broadcast setting with M = 2 antennas at the transmitter and two users (each with a single antenna) is considered. It is assumed that the users have perfect channel information about their links, whereas the transmitter has only statistical information of each user's link (covariance matrix of the vector channel). A low-complexity linear beamforming strategy ... View full abstract»
-
SINR Statistics of Correlated MIMO Linear Receivers
Publication Year: 2013, Page(s):6490 - 6500
Cited by: Papers (6)Linear receivers offer a low complexity option for multiantenna communication systems. Therefore, understanding the outage behavior of the corresponding SINR is important in a fading mobile environment. In this paper, we introduce a large deviation method, valid nominally for a large number M of antennas, which provides the probability density of the SINR of Gaussian channel MIMO minimum mean squa... View full abstract»
-
On Convexity of Error Rates in Digital Communications
Publication Year: 2013, Page(s):6501 - 6516
Cited by: Papers (4)Convexity properties of error rates of a class of decoders, including the maximum-likelihood/min-distance one as a special case, are studied for arbitrary constellations, bit mapping, and coding. Earlier results obtained for the additive white Gaussian noise channel are extended to a wide class of noise densities, including unimodal and spherically invariant noise. Under these broad conditions, sy... View full abstract»
-
On an Achievable Rate of Large Rayleigh Block-Fading MIMO Channels With No CSI
Publication Year: 2013, Page(s):6517 - 6541
Cited by: Papers (11)Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable rates of successive decoding (SD) receivers based on the linear minimum mean-squared error (LMMSE) channel estimation are analyzed in the large-system limit, b... View full abstract»
-
On the Degrees of Freedom of K-User SISO Interference and X Channels With Delayed CSIT
Publication Year: 2013, Page(s):6542 - 6561
Cited by: Papers (43)The K-user single-input single-output (SISO) additive white Gaussian noise (AWGN) interference channel and 2×K SISO AWGN X channel are considered, where the transmitters have delayed channel state information (CSI) through noiseless feedback links. Multiphase transmission schemes are proposed for both channels which possess novel ingredients, namely, multiphase partial interference nulling,... View full abstract»
Aims & Scope
IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.
Meet Our Editors
Editor-in-Chief
Prakash Narayan
Department of Electrical and Computer Engineering