Applications of coding theory to communication combinatorial problems

DOI10.1016/0012-365X(90)90009-7zbMath0704.05005MaRDI QIDQ916665

Gérard D. Cohen

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

codingwritingconflict resolution with feedbackmemories with defectsmultiple access channelsreluctant memories

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Enumerative combinatorics (05A99) Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)

Related Items (3)

A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Union-free hypergraphs and probability theory
• Explicit construction of exponential sized families of k-independent sets
• Families of finite sets in which no set is covered by the union of two others
• Coding for write-unidirectional memories and conflict resolution
• Families of \(k\)-independent sets
• Separating Partition Systems and Locally Different Sequences
• A nonconstructive upper bound on covering radius
• Partitioned linear block codes for computer memory with 'stuck-at' defects
• Fredman–Komlós bounds and information theory
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• An error correcting scheme for defective memory
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Determination of two vectors from the sum

This page was built for publication: Applications of coding theory to communication combinatorial problems