Alon, Noga and Bruck, Jehoshua and Naor, Joseph and Naor, Moni and Roth, Ron M. (1991) Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. In: IEEE International Symposium on Information Theory (ISIT '91). IEEE , Piscataway, NJ, p. 139. ISBN 0780300564. https://resolver.caltech.edu/CaltechAUTHORS:ALOisit91
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 62Kb |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:ALOisit91
Abstract
A new technique, based on the pseudo-random properties of certain graphs, known as expanders, is used to obtain new simple explicit constructions of asymptotically good codes.
| Item Type: | Book Section | ||||||
|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||
| ORCID: |
| ||||||
| Additional Information: | © Copyright 1991 IEEE. Reprinted with permission. Publication Date: 24-28 June 1991. | ||||||
| Record Number: | CaltechAUTHORS:ALOisit91 | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:ALOisit91 | ||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
| ID Code: | 10828 | ||||||
| Collection: | CaltechAUTHORS | ||||||
| Deposited By: | Kristin Buxton | ||||||
| Deposited On: | 19 Jun 2008 | ||||||
| Last Modified: | 22 Nov 2019 09:58 |
Repository Staff Only: item control page
