Applications of coding theory to communication combinatorial problems
DOI10.1016/0012-365X(90)90009-7zbMATH Open0704.05005MaRDI QIDQ916665FDOQ916665
Authors: Gérard Cohen 
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1104300
- scientific article; zbMATH DE number 3409222
- On some topics in combinatorial coding theory
- scientific article; zbMATH DE number 1077413
- Some Applications of Coding Theory in Computational Complexity
- Coding theory and algebraic combinatorics
- Communication Complexity
- scientific article; zbMATH DE number 1342086
- Publication:4863691
codingwritingconflict resolution with feedbackmemories with defectsmultiple access channelsreluctant memories
Enumerative combinatorics (05A99) Communication theory (94A05) Linear codes (general theory) (94B05) Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- Families of finite sets in which no set is covered by the union of two others
- Families of \(k\)-independent sets
- Fredman–Komlós bounds and information theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Separating Partition Systems and Locally Different Sequences
- Title not available (Why is that?)
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Explicit construction of exponential sized families of k-independent sets
- Coding for write-unidirectional memories and conflict resolution
- A nonconstructive upper bound on covering radius
- Determination of two vectors from the sum
- Union-free hypergraphs and probability theory
- Partitioned linear block codes for computer memory with 'stuck-at' defects
- Title not available (Why is that?)
- Title not available (Why is that?)
- An error correcting scheme for defective memory
- Title not available (Why is that?)
Cited In (8)
- A Graham-Sloane type construction for \(s\)-surjective matrices
- New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Applications of Coding Theory in Computational Complexity
- An Application of Coding Theory to a File Address Problem
- The application of coding theory to the design of combinatorial filing schemes of any order
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
This page was built for publication: Applications of coding theory to communication combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916665)
