On codes from hypergraphs.

DOI10.1016/j.ejc.2003.10.002zbMath1063.94104OpenAlexW2051569409MaRDI QIDQ1427432

Yonatan Bilu, Shlomo Hoory

Publication date: 14 March 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.10.002

zbMATH Keywords

binary codeshypergraph theoryexpander codes\(t\)-uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial codes (94B25) Decoding (94B35)

Related Items

Expander graphs and their applications ⋮ Deterministic Tensor Completion with Hypergraph Expanders ⋮ Low-complexity error correction of Hamming-code-based LDPC codes ⋮ Sparse random tensors: concentration, regularization and applications ⋮ Decoding concatenated codes with inner convolutional codes ⋮ EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS

Cites Work

• Ramanujan graphs
• Relative expanders or weakly relatively Ramanujan graphs.
• Derandomized graph products
• Expander codes
• A recursive approach to low complexity codes
• On expander codes
• Error exponents of expander codes
• Unnamed Item
• Unnamed Item
• Unnamed Item