The capacity of $C_{5}$ and free sets in $C_{m}^{2}$
HTML articles powered by AMS MathViewer
- by D. G. Mead and W. Narkiewicz PDF
- Proc. Amer. Math. Soc. 84 (1982), 308-310 Request permission
Abstract:
In a recent paper, S. K. Stein examined the problem of determining the cardinality, $\tau (C_m^k)$, of the largest subset $S$ of the direct product $C_m^k$ of $k$ copies of ${C_m}$ such that distinct sums of elements of $S$ yield distinct elements of $C_m^k$. In this paper we show that ${\tau ^* }({C_5}) = {\lim _{k \to \infty }}(\tau (C_5^k)/k) = 2$, answering a question raised by Stein. We also produce an infinite set of $m$’s such that $\tau (C_m^2) > 2[{\log _2}m]$.References
- J.-P. Serre, A course in arithmetic, Graduate Texts in Mathematics, No. 7, Springer-Verlag, New York-Heidelberg, 1973. Translated from the French. MR 0344216, DOI 10.1007/978-1-4684-9884-4
- Claude E. Shannon, The zero error capacity of a noisy channel, Institute of Radio Engineers Transactions on Information Theory IT-2 (1956), no. September, 8–19. MR 89131, DOI 10.1109/tit.1956.1056798
- S. K. Stein, Modified linear dependence and the capacity of a cyclic graph, Linear Algebra Appl. 17 (1977), no. 3, 191–195. MR 463019, DOI 10.1016/0024-3795(77)90061-1
Additional Information
- © Copyright 1982 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 84 (1982), 308-310
- MSC: Primary 20D60; Secondary 10L02, 94A15
- DOI: https://doi.org/10.1090/S0002-9939-1982-0637189-4
- MathSciNet review: 637189