Good expander graphs and expander codes: parameters and decoding

Authors:
H. Janwa
Affiliations:
UPR-Rio Piedras, San Juan
Venue:
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Year:
2003

Citing 17
Cited 1

On the minimum distance of cyclic codes

IEEE Transactions on Information Theory
Eigen values and expanders

Combinatorica
Dense expanders and pseudo-random bipartite graphs

Discrete Mathematics
Which extended Goppa codes are cyclic?

Journal of Combinatorial Theory Series A
Diameter, covering index, covering radius and eigenvalues

European Journal of Combinatorics
The parameters of subcodes of algebraic-geometric codes over prime subfields

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Spectra of regular graphs and hypergraphs and orthogonal polynomials

European Journal of Combinatorics
Designs, Graphs, Codes, and Their Links

Designs, Graphs, Codes, and Their Links
Algebraic-Geometric Codes

Algebraic-Geometric Codes
Covering Radii of Even Subcodes of t-dense Codes

AAECC-3 Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes
Hyperplane Sections of Fermat Varieties in P3 in Char.2 and Some Applications to Cyclic Codes

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Introduction to Parallel Algorithms and Architectures: Algorithms and Vlsi

Introduction to Parallel Algorithms and Architectures: Algorithms and Vlsi
Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases

IEEE Transactions on Information Theory - Part 1
Expander codes

IEEE Transactions on Information Theory - Part 1
Linear-time encodable and decodable error-correcting codes

IEEE Transactions on Information Theory - Part 1
Packing radius, covering radius, and dual distance

IEEE Transactions on Information Theory
Ap-Adic Serre Bound

Finite Fields and Their Applications

Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes

AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present some explicit constructions of families of constant degree expander graphs. We use them to give constructions of expander codes and determine stronger bounds on their parameters. We also show that some of these codes can be decoded very efficiently using the decoding algorithm recently given by Janwa and Lal.