On codes from hypergraphs. (Q1427432): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2003.10.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051569409 / rank | |||
Normal rank | |||
Revision as of 01:51, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On codes from hypergraphs. |
scientific article |
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
