Applications of coding theory to communication combinatorial problems
- 1 August 1990
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 83 (2-3), 237-248
- https://doi.org/10.1016/0012-365x(90)90009-7
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Coding for write-unidirectional memories and conflict resolutionDiscrete Applied Mathematics, 1989
- Explicit construction of exponential sized families of k-independent setsDiscrete Mathematics, 1986
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channelsJournal of the ACM, 1985
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channelsIEEE Transactions on Information Theory, 1985
- Union-free Hypergraphs and Probability TheoryEuropean Journal of Combinatorics, 1984
- Partitioned linear block codes for computer memory with 'stuck-at' defectsIEEE Transactions on Information Theory, 1983
- Families of finite sets in which no set is covered by the union of two othersJournal of Combinatorial Theory, Series A, 1982
- An error correcting scheme for defective memoryIEEE Transactions on Information Theory, 1978
- Families of k-independent setsDiscrete Mathematics, 1973
- Determination of two vectors from the sumJournal of Combinatorial Theory, 1969