On codes from hypergraphs. (Q1427432)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On codes from hypergraphs. |
scientific article; zbMATH DE number 2055704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On codes from hypergraphs. |
scientific article; zbMATH DE number 2055704 |
Statements
On codes from hypergraphs. (English)
0 references
14 March 2004
0 references
Based on hypergraph theory, the authors propose a new family of binary codes. This family of codes generalizes a previous construction of expander codes to \(t\)-uniform hypergraphs. After the introduction Section 2 defines hypergraph codes and gives some properties of them. Section 3 describes the decoding algorithm and introduces the main theorems. The following sections give the proofs of these theorems. Some open problems are presented in section 4.
0 references
binary codes
0 references
expander codes
0 references
hypergraph theory
0 references
\(t\)-uniform hypergraph
0 references
0 references
0 references
0.89489436
0 references
0.88919544
0 references