𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Applications of coding theory to communication combinatorial problems

✍ Scribed by Gérard D. Cohen

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
750 KB
Volume
83
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Nous prtsentons une synthese et quelques resultats sur l'emploi de techniques emprunttes aux codes correcteurs d'erreurs pour la solution de probltmes combinatoires dans le domaine des communications. Les questions aborddes sont essentiellement les suivantes: -resolution de conflit avec feedback dans les canaux a acces multiple, -codage pour memoires defectueuses, -Ccriture sur des memoires rkticentes.

We present a survey and a few results on the use of techniques borrowed from coding theory for solving combinatorial questions originating in communication problems.

We will mainly deal with the three following topics: -conflict resolution with feedback in multiple access channels, -coding for memories with defects, -writing on reluctant memories.

Example 1: n = 9, s = 3. Consider the following set of 6 queries:

📜 SIMILAR VOLUMES

A problem of combinatorial designs relat
A problem of combinatorial designs related to authentication codes
✍ Dingyi Pei 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB 👁 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially

Applications of Coding Theory to the Con
Applications of Coding Theory to the Construction of Modular Lattices
✍ Christine Bachoc 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 439 KB

We study self-dual codes over certain finite rings which are quotients of quadratic imaginary fields or of totally definite quaternion fields over Q. A natural weight taking two different nonzero values is defined over these rings; using invariant theory, we give a basis for the space of invariants

Pseudo quasi-3 designs and their applica
Pseudo quasi-3 designs and their applications to coding theory
✍ Carl Bracken 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract We define a pseudo quasi‐3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi‐symmetric. Quasi‐symmetric designs can be used to construct optimal self complementary codes. In this article we give a constructi