On codes from hypergraphs. (Q1427432): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
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
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error exponents of expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative expanders or weakly relatively Ramanujan graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive approach to low complexity codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expander codes / rank
 
Normal rank

Revision as of 14:26, 6 June 2024

scientific article
Language Label Description Also known as
English
On codes from hypergraphs.
scientific article

    Statements

    On codes from hypergraphs. (English)
    0 references
    0 references
    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
    0 references
    binary codes
    0 references
    expander codes
    0 references
    hypergraph theory
    0 references
    \(t\)-uniform hypergraph
    0 references

    Identifiers