| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
07 February 2025 |
|
| | | |
|
Article overview
| |
|
Symmetric Unique Neighbor Expanders and Good LDPC Codes | Oren Becker
; | Date: |
1 May 2016 | Abstract: | An infinite family of bounded-degree ’unique-neighbor’ expanders was
constructed explicitly by Alon and Capalbo (2002). We present an infinite
family F of bounded-degree unique-neighbor expanders with the additional
property that every graph in the family F is a Cayley graph. This answers a
question raised by Tali Kaufman. Using the same methods, we show that the
symmetric LDPC codes constructed by Kaufman and Lubotzky (2012) are in fact
symmetric under a simply transitive group action on coordinates. | Source: | arXiv, 1605.0240 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|