Skip to content

Commit 5b120ec

Browse files
authored
Merge pull request #27 from jzuiddam/patch-2
Add Shannon 1956 upper bound plus reference
2 parents bca1b48 + 0837c8c commit 5b120ec

File tree

1 file changed

+8
-6
lines changed

1 file changed

+8
-6
lines changed

constants/9a.md

Lines changed: 8 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -24,6 +24,7 @@ is the strong graph product.
2424

2525
| Bound | Reference | Comments |
2626
| ----- | --------- | -------- |
27+
| $7/2 = 3.5$ | [S1956] | Fractional clique cover bound |
2728
| $\vartheta({\mathcal C}_{7}) \approx 3.3177$ | [L1979] | Lovász theta-function bound |
2829

2930
---
@@ -51,14 +52,15 @@ channel whose confusability graph is $G$.
5152

5253
## References
5354

54-
- [BMRRST1971] L. Baumert, R. McEliece, E. Rodemich, H. Rumsey, R. Stanley, H. Taylor. *A combinatorial packing
55-
problem*. Computers in Algebra and Number Theory, American Mathematical Society, Providence,
55+
- [S1956] C. Shannon. The zero error capacity of a noisy channel. IRE Transactions on Information Theory, vol. 2, no. 3 (1956), 8-19. doi: 10.1109/TIT.1956.1056798
56+
- [BMRRST1971] L. Baumert, R. McEliece, E. Rodemich, H. Rumsey, R. Stanley, H. Taylor. A combinatorial packing
57+
problem. Computers in Algebra and Number Theory, American Mathematical Society, Providence,
5658
RI (1971), 97–108.
57-
- [L1979] Lovász, L. *On the Shannon capacity of a graph*. IEEE Transactions on Information Theory **25** (1979), 1–7.
58-
- [PS2018] Sven Polak, Alexander Schrijver. *New lower bound on the Shannon capacity of C7 from circular graphs*. Information Processing Letters, 143 (2019), 37-40. arXiv:1808.07438.
59-
- [MO2017] K.A. Mathew, P.R.J. Östergård. *New lower bounds for the Shannon capacity of odd cycles*. Designs,
59+
- [L1979] Lovász, L. On the Shannon capacity of a graph. IEEE Transactions on Information Theory **25** (1979), 1–7.
60+
- [PS2018] Sven Polak, Alexander Schrijver. New lower bound on the Shannon capacity of $C_7$ from circular graphs. Information Processing Letters, 143 (2019), 37-40. arXiv:1808.07438.
61+
- [MO2017] K.A. Mathew, P.R.J. Östergård. New lower bounds for the Shannon capacity of odd cycles. Designs,
6062
Codes and Cryptography, 84 (2017), 13–22.
61-
- [VZ2002] A. Vesel, J. Zerovnik, Improved lower bound on the Shannon capacity of $C_7$, Information Processing
63+
- [VZ2002] A. Vesel, J. Zerovnik. Improved lower bound on the Shannon capacity of $C_7$. Information Processing
6264
Letters, 81 (2002), 277–282.
6365

6466
## Contribution notes

0 commit comments

Comments
 (0)